TSTP Solution File: PUZ012-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : PUZ012-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 : Sat May 4 09:11:45 EDT 2024
% Result : Unsatisfiable 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 37 ( 21 unt; 4 nHn; 33 RR)
% Number of literals : 60 ( 0 equ; 31 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% 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 : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(label_is_wrong,axiom,
( ~ label(X1,X2)
| ~ contains(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.vzbHDIH8vK/E---3.1_7925.p',label_is_wrong) ).
cnf(prove_boxa_contains_bananas_and_boxc_oranges,negated_conjecture,
( ~ contains(boxa,bananas)
| ~ contains(boxc,oranges) ),
file('/export/starexec/sandbox/tmp/tmp.vzbHDIH8vK/E---3.1_7925.p',prove_boxa_contains_bananas_and_boxc_oranges) ).
cnf(boxb_labelled_oranges,hypothesis,
label(boxb,oranges),
file('/export/starexec/sandbox/tmp/tmp.vzbHDIH8vK/E---3.1_7925.p',boxb_labelled_oranges) ).
cnf(each_thing_is_in_a_box,axiom,
( contains(boxa,X1)
| contains(boxb,X1)
| contains(boxc,X1) ),
file('/export/starexec/sandbox/tmp/tmp.vzbHDIH8vK/E---3.1_7925.p',each_thing_is_in_a_box) ).
cnf(boxa_labelled_apples,hypothesis,
label(boxa,apples),
file('/export/starexec/sandbox/tmp/tmp.vzbHDIH8vK/E---3.1_7925.p',boxa_labelled_apples) ).
cnf(contains_is_well_defined1,axiom,
( equal_fruits(X2,X3)
| ~ contains(X1,X2)
| ~ contains(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.vzbHDIH8vK/E---3.1_7925.p',contains_is_well_defined1) ).
cnf(each_box_contains_something,axiom,
( contains(X1,apples)
| contains(X1,bananas)
| contains(X1,oranges) ),
file('/export/starexec/sandbox/tmp/tmp.vzbHDIH8vK/E---3.1_7925.p',each_box_contains_something) ).
cnf(bananas_not_oranges,axiom,
~ equal_fruits(bananas,oranges),
file('/export/starexec/sandbox/tmp/tmp.vzbHDIH8vK/E---3.1_7925.p',bananas_not_oranges) ).
cnf(boxc_labelled_bananas,hypothesis,
label(boxc,bananas),
file('/export/starexec/sandbox/tmp/tmp.vzbHDIH8vK/E---3.1_7925.p',boxc_labelled_bananas) ).
cnf(apples_not_bananas,axiom,
~ equal_fruits(apples,bananas),
file('/export/starexec/sandbox/tmp/tmp.vzbHDIH8vK/E---3.1_7925.p',apples_not_bananas) ).
cnf(boxb_contains_apples,hypothesis,
contains(boxb,apples),
file('/export/starexec/sandbox/tmp/tmp.vzbHDIH8vK/E---3.1_7925.p',boxb_contains_apples) ).
cnf(c_0_11,plain,
( ~ label(X1,X2)
| ~ contains(X1,X2) ),
inference(fof_simplification,[status(thm)],[label_is_wrong]) ).
cnf(c_0_12,negated_conjecture,
( ~ contains(boxa,bananas)
| ~ contains(boxc,oranges) ),
inference(fof_simplification,[status(thm)],[prove_boxa_contains_bananas_and_boxc_oranges]) ).
cnf(c_0_13,plain,
( ~ label(X1,X2)
| ~ contains(X1,X2) ),
c_0_11 ).
cnf(c_0_14,hypothesis,
label(boxb,oranges),
boxb_labelled_oranges ).
cnf(c_0_15,negated_conjecture,
( ~ contains(boxa,bananas)
| ~ contains(boxc,oranges) ),
c_0_12 ).
cnf(c_0_16,axiom,
( contains(boxa,X1)
| contains(boxb,X1)
| contains(boxc,X1) ),
each_thing_is_in_a_box ).
cnf(c_0_17,hypothesis,
~ contains(boxb,oranges),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,hypothesis,
label(boxa,apples),
boxa_labelled_apples ).
cnf(c_0_19,plain,
( equal_fruits(X2,X3)
| ~ contains(X1,X2)
| ~ contains(X1,X3) ),
inference(fof_simplification,[status(thm)],[contains_is_well_defined1]) ).
cnf(c_0_20,negated_conjecture,
( contains(boxa,oranges)
| ~ contains(boxa,bananas) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_21,axiom,
( contains(X1,apples)
| contains(X1,bananas)
| contains(X1,oranges) ),
each_box_contains_something ).
cnf(c_0_22,hypothesis,
~ contains(boxa,apples),
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_23,plain,
~ equal_fruits(bananas,oranges),
inference(fof_simplification,[status(thm)],[bananas_not_oranges]) ).
cnf(c_0_24,plain,
( equal_fruits(X2,X3)
| ~ contains(X1,X2)
| ~ contains(X1,X3) ),
c_0_19 ).
cnf(c_0_25,negated_conjecture,
contains(boxa,oranges),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_26,hypothesis,
label(boxc,bananas),
boxc_labelled_bananas ).
cnf(c_0_27,plain,
~ equal_fruits(bananas,oranges),
c_0_23 ).
cnf(c_0_28,negated_conjecture,
( equal_fruits(X1,oranges)
| ~ contains(boxa,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,hypothesis,
~ contains(boxc,bananas),
inference(spm,[status(thm)],[c_0_13,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
~ contains(boxa,bananas),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
~ equal_fruits(apples,bananas),
inference(fof_simplification,[status(thm)],[apples_not_bananas]) ).
cnf(c_0_32,hypothesis,
contains(boxb,bananas),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_16]),c_0_30]) ).
cnf(c_0_33,plain,
~ equal_fruits(apples,bananas),
c_0_31 ).
cnf(c_0_34,hypothesis,
( equal_fruits(X1,bananas)
| ~ contains(boxb,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_32]) ).
cnf(c_0_35,hypothesis,
contains(boxb,apples),
boxb_contains_apples ).
cnf(c_0_36,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : PUZ012-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n015.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 11:31:21 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.vzbHDIH8vK/E---3.1_7925.p
% 0.21/0.50 # Version: 3.1.0
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # new_bool_1 with pid 8032 completed with status 0
% 0.21/0.50 # Result found by new_bool_1
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FGHNS-FFSS00-SFFFFFNN
% 0.21/0.50 # partial match(1): FGHNF-FFSS00-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50 # SAT001_MinMin_p005000_rr_RG with pid 8038 completed with status 0
% 0.21/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FGHNS-FFSS00-SFFFFFNN
% 0.21/0.50 # partial match(1): FGHNF-FFSS00-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Unsatisfiable
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 18
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 18
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 18
% 0.21/0.50 # Processed clauses : 47
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 1
% 0.21/0.50 # ...remaining for further processing : 46
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 2
% 0.21/0.50 # Backward-rewritten : 1
% 0.21/0.50 # Generated clauses : 19
% 0.21/0.50 # ...of the previous two non-redundant : 17
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 19
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 3
% 0.21/0.50 # ...of those cached : 1
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 25
% 0.21/0.50 # Positive orientable unit clauses : 8
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 10
% 0.21/0.50 # Non-unit-clauses : 7
% 0.21/0.50 # Current number of unprocessed clauses: 6
% 0.21/0.50 # ...number of literals in the above : 19
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 21
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 17
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 13
% 0.21/0.50 # Non-unit clause-clause subsumptions : 0
% 0.21/0.50 # Unit Clause-clause subsumption calls : 18
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 13
% 0.21/0.50 # BW rewrite match successes : 1
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 482
% 0.21/0.50 # Search garbage collected termcells : 30
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.003 s
% 0.21/0.50 # System time : 0.003 s
% 0.21/0.50 # Total time : 0.006 s
% 0.21/0.50 # Maximum resident set size: 1612 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.003 s
% 0.21/0.50 # System time : 0.006 s
% 0.21/0.50 # Total time : 0.009 s
% 0.21/0.50 # Maximum resident set size: 1696 pages
% 0.21/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------