TSTP Solution File: PUZ012_1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PUZ012_1 : TPTP v8.2.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 02:24:24 EDT 2024
% Result : Theorem 0.21s 0.48s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 22
% Syntax : Number of formulae : 53 ( 22 unt; 11 typ; 0 def)
% Number of atoms : 72 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 58 ( 28 ~; 25 |; 4 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 23 ( 0 sgn 23 !; 0 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
box: $tType ).
tff(decl_sort2,type,
fruit: $tType ).
tff(decl_22,type,
boxa: box ).
tff(decl_23,type,
boxb: box ).
tff(decl_24,type,
boxc: box ).
tff(decl_25,type,
apples: fruit ).
tff(decl_26,type,
bananas: fruit ).
tff(decl_27,type,
oranges: fruit ).
tff(decl_29,type,
equal_boxes: ( box * box ) > $o ).
tff(decl_30,type,
contains: ( box * fruit ) > $o ).
tff(decl_31,type,
label: ( box * fruit ) > $o ).
tff(label_is_wrong,axiom,
! [X3: box,X4: fruit] :
~ ( label(X3,X4)
& contains(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',label_is_wrong) ).
tff(prove_boxa_contains_bananas_and_boxc_oranges,conjecture,
( contains(boxa,bananas)
& contains(boxc,oranges) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_boxa_contains_bananas_and_boxc_oranges) ).
tff(boxc_labelled_bananas,hypothesis,
label(boxc,bananas),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',boxc_labelled_bananas) ).
tff(each_box_contains_something,axiom,
! [X5: box] :
( contains(X5,apples)
| contains(X5,bananas)
| contains(X5,oranges) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',each_box_contains_something) ).
tff(each_thing_is_in_a_box,axiom,
! [X1: fruit] :
( contains(boxa,X1)
| contains(boxb,X1)
| contains(boxc,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',each_thing_is_in_a_box) ).
tff(boxb_labelled_oranges,hypothesis,
label(boxb,oranges),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',boxb_labelled_oranges) ).
tff(boxa_not_boxc,axiom,
~ equal_boxes(boxa,boxc),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',boxa_not_boxc) ).
tff(contains_is_well_defined2,axiom,
! [X8: box,X4: fruit,X9: box] :
( ( contains(X8,X4)
& contains(X9,X4) )
=> equal_boxes(X8,X9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',contains_is_well_defined2) ).
tff(boxa_labelled_apples,hypothesis,
label(boxa,apples),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',boxa_labelled_apples) ).
tff(boxb_not_boxc,axiom,
~ equal_boxes(boxb,boxc),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',boxb_not_boxc) ).
tff(boxb_contains_apples,hypothesis,
contains(boxb,apples),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',boxb_contains_apples) ).
tff(c_0_11,plain,
! [X10: box,X11: fruit] :
( ~ label(X10,X11)
| ~ contains(X10,X11) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[label_is_wrong])])]) ).
tff(c_0_12,negated_conjecture,
~ ( contains(boxa,bananas)
& contains(boxc,oranges) ),
inference(assume_negation,[status(cth)],[prove_boxa_contains_bananas_and_boxc_oranges]) ).
tcf(c_0_13,plain,
! [X2: box,X1: fruit] :
( ~ label(X2,X1)
| ~ contains(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_14,hypothesis,
label(boxc,bananas),
inference(split_conjunct,[status(thm)],[boxc_labelled_bananas]) ).
tff(c_0_15,plain,
! [X12: box] :
( contains(X12,apples)
| contains(X12,bananas)
| contains(X12,oranges) ),
inference(variable_rename,[status(thm)],[each_box_contains_something]) ).
tff(c_0_16,negated_conjecture,
( ~ contains(boxa,bananas)
| ~ contains(boxc,oranges) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])]) ).
tff(c_0_17,plain,
! [X13: fruit] :
( contains(boxa,X13)
| contains(boxb,X13)
| contains(boxc,X13) ),
inference(variable_rename,[status(thm)],[each_thing_is_in_a_box]) ).
tcf(c_0_18,hypothesis,
label(boxb,oranges),
inference(split_conjunct,[status(thm)],[boxb_labelled_oranges]) ).
tff(c_0_19,plain,
~ equal_boxes(boxa,boxc),
inference(fof_simplification,[status(thm)],[boxa_not_boxc]) ).
tff(c_0_20,plain,
! [X17: box,X18: fruit,X19: box] :
( ~ contains(X17,X18)
| ~ contains(X19,X18)
| equal_boxes(X17,X19) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[contains_is_well_defined2])])]) ).
tcf(c_0_21,hypothesis,
~ contains(boxc,bananas),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
tcf(c_0_22,plain,
! [X2: box] :
( contains(X2,apples)
| contains(X2,bananas)
| contains(X2,oranges) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
tcf(c_0_23,negated_conjecture,
( ~ contains(boxa,bananas)
| ~ contains(boxc,oranges) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
tcf(c_0_24,plain,
! [X1: fruit] :
( contains(boxa,X1)
| contains(boxb,X1)
| contains(boxc,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
tcf(c_0_25,hypothesis,
~ contains(boxb,oranges),
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
tcf(c_0_26,hypothesis,
label(boxa,apples),
inference(split_conjunct,[status(thm)],[boxa_labelled_apples]) ).
tff(c_0_27,plain,
~ equal_boxes(boxa,boxc),
inference(fof_nnf,[status(thm)],[c_0_19]) ).
tcf(c_0_28,plain,
! [X3: box,X2: box,X1: fruit] :
( equal_boxes(X2,X3)
| ~ contains(X2,X1)
| ~ contains(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
tcf(c_0_29,hypothesis,
( contains(boxc,oranges)
| contains(boxc,apples) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
tcf(c_0_30,negated_conjecture,
( contains(boxa,oranges)
| ~ contains(boxa,bananas) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
tcf(c_0_31,hypothesis,
~ contains(boxa,apples),
inference(spm,[status(thm)],[c_0_13,c_0_26]) ).
tff(c_0_32,plain,
~ equal_boxes(boxb,boxc),
inference(fof_simplification,[status(thm)],[boxb_not_boxc]) ).
tcf(c_0_33,plain,
~ equal_boxes(boxa,boxc),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
tcf(c_0_34,hypothesis,
! [X2: box] :
( contains(boxc,apples)
| equal_boxes(X2,boxc)
| ~ contains(X2,oranges) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
tcf(c_0_35,negated_conjecture,
contains(boxa,oranges),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_22]),c_0_31]) ).
tff(c_0_36,plain,
~ equal_boxes(boxb,boxc),
inference(fof_nnf,[status(thm)],[c_0_32]) ).
tcf(c_0_37,hypothesis,
contains(boxc,apples),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
tcf(c_0_38,plain,
~ equal_boxes(boxb,boxc),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
tcf(c_0_39,hypothesis,
! [X2: box] :
( equal_boxes(X2,boxc)
| ~ contains(X2,apples) ),
inference(spm,[status(thm)],[c_0_28,c_0_37]) ).
tcf(c_0_40,hypothesis,
contains(boxb,apples),
inference(split_conjunct,[status(thm)],[boxb_contains_apples]) ).
cnf(c_0_41,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PUZ012_1 : TPTP v8.2.0. Released v5.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n019.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sat May 18 10:41:22 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.48 # Version: 3.1.0
% 0.21/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.48 # Starting sh5l with 300s (1) cores
% 0.21/0.48 # new_bool_1 with pid 6980 completed with status 0
% 0.21/0.48 # Result found by new_bool_1
% 0.21/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.48 # Search class: FGHNS-FFSS00-SFFFFFNN
% 0.21/0.48 # partial match(1): FGHNF-FFSS00-SFFFFFNN
% 0.21/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.48 # SAT001_MinMin_p005000_rr_RG with pid 6988 completed with status 0
% 0.21/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.48 # Search class: FGHNS-FFSS00-SFFFFFNN
% 0.21/0.48 # partial match(1): FGHNF-FFSS00-SFFFFFNN
% 0.21/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.48 # Preprocessing time : 0.001 s
% 0.21/0.48 # Presaturation interreduction done
% 0.21/0.48
% 0.21/0.48 # Proof found!
% 0.21/0.48 # SZS status Theorem
% 0.21/0.48 # SZS output start CNFRefutation
% See solution above
% 0.21/0.48 # Parsed axioms : 30
% 0.21/0.48 # Removed by relevancy pruning/SinE : 12
% 0.21/0.48 # Initial clauses : 18
% 0.21/0.48 # Removed in clause preprocessing : 0
% 0.21/0.48 # Initial clauses in saturation : 18
% 0.21/0.48 # Processed clauses : 49
% 0.21/0.48 # ...of these trivial : 0
% 0.21/0.48 # ...subsumed : 0
% 0.21/0.48 # ...remaining for further processing : 49
% 0.21/0.48 # Other redundant clauses eliminated : 0
% 0.21/0.48 # Clauses deleted for lack of memory : 0
% 0.21/0.48 # Backward-subsumed : 3
% 0.21/0.48 # Backward-rewritten : 3
% 0.21/0.48 # Generated clauses : 23
% 0.21/0.48 # ...of the previous two non-redundant : 20
% 0.21/0.48 # ...aggressively subsumed : 0
% 0.21/0.48 # Contextual simplify-reflections : 0
% 0.21/0.48 # Paramodulations : 23
% 0.21/0.48 # Factorizations : 0
% 0.21/0.48 # NegExts : 0
% 0.21/0.48 # Equation resolutions : 0
% 0.21/0.48 # Disequality decompositions : 0
% 0.21/0.48 # Total rewrite steps : 7
% 0.21/0.48 # ...of those cached : 4
% 0.21/0.48 # Propositional unsat checks : 0
% 0.21/0.48 # Propositional check models : 0
% 0.21/0.48 # Propositional check unsatisfiable : 0
% 0.21/0.48 # Propositional clauses : 0
% 0.21/0.48 # Propositional clauses after purity: 0
% 0.21/0.48 # Propositional unsat core size : 0
% 0.21/0.48 # Propositional preprocessing time : 0.000
% 0.21/0.48 # Propositional encoding time : 0.000
% 0.21/0.48 # Propositional solver time : 0.000
% 0.21/0.48 # Success case prop preproc time : 0.000
% 0.21/0.48 # Success case prop encoding time : 0.000
% 0.21/0.48 # Success case prop solver time : 0.000
% 0.21/0.48 # Current number of processed clauses : 25
% 0.21/0.48 # Positive orientable unit clauses : 9
% 0.21/0.48 # Positive unorientable unit clauses: 0
% 0.21/0.48 # Negative unit clauses : 10
% 0.21/0.48 # Non-unit-clauses : 6
% 0.21/0.48 # Current number of unprocessed clauses: 5
% 0.21/0.48 # ...number of literals in the above : 15
% 0.21/0.48 # Current number of archived formulas : 0
% 0.21/0.48 # Current number of archived clauses : 24
% 0.21/0.48 # Clause-clause subsumption calls (NU) : 22
% 0.21/0.48 # Rec. Clause-clause subsumption calls : 17
% 0.21/0.48 # Non-unit clause-clause subsumptions : 0
% 0.21/0.48 # Unit Clause-clause subsumption calls : 16
% 0.21/0.48 # Rewrite failures with RHS unbound : 0
% 0.21/0.48 # BW rewrite match attempts : 14
% 0.21/0.48 # BW rewrite match successes : 2
% 0.21/0.48 # Condensation attempts : 0
% 0.21/0.48 # Condensation successes : 0
% 0.21/0.48 # Termbank termtop insertions : 984
% 0.21/0.48 # Search garbage collected termcells : 61
% 0.21/0.48
% 0.21/0.48 # -------------------------------------------------
% 0.21/0.48 # User time : 0.005 s
% 0.21/0.48 # System time : 0.001 s
% 0.21/0.48 # Total time : 0.007 s
% 0.21/0.48 # Maximum resident set size: 1796 pages
% 0.21/0.48
% 0.21/0.48 # -------------------------------------------------
% 0.21/0.48 # User time : 0.008 s
% 0.21/0.48 # System time : 0.002 s
% 0.21/0.48 # Total time : 0.010 s
% 0.21/0.48 # Maximum resident set size: 1720 pages
% 0.21/0.48 % E---3.1 exiting
% 0.21/0.49 % E exiting
%------------------------------------------------------------------------------