TSTP Solution File: MSC002-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : MSC002-1 : TPTP v8.1.2. Released v1.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:39:02 EDT 2023
% Result : Unsatisfiable 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 29 ( 9 unt; 2 nHn; 19 RR)
% Number of literals : 58 ( 0 equ; 32 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 71 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(can_put_somewhere_if_grab_and_go_there,axiom,
( put(X1,X4,go(X4,X3))
| ~ at(X1,X2,X3)
| ~ grabbed(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.FQB46WMgMa/E---3.1_17006.p',can_put_somewhere_if_grab_and_go_there) ).
cnf(situation_pick_up,axiom,
( at(X1,X2,pick_up(X3))
| ~ at(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.FQB46WMgMa/E---3.1_17006.p',situation_pick_up) ).
cnf(can_grab_if_previously_let_go,axiom,
( grabbed(X1,pick_up(go(X2,let_go(X3))))
| ~ at(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.FQB46WMgMa/E---3.1_17006.p',can_grab_if_previously_let_go) ).
cnf(thing_either_held_or_went_there,axiom,
( held(X1,X2)
| at(X1,X3,go(X4,X2))
| ~ at(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.FQB46WMgMa/E---3.1_17006.p',thing_either_held_or_went_there) ).
cnf(situation_let_go,axiom,
( at(X1,X2,let_go(X3))
| ~ at(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.FQB46WMgMa/E---3.1_17006.p',situation_let_go) ).
cnf(cant_hold_and_let_go,axiom,
~ held(X1,let_go(X2)),
file('/export/starexec/sandbox2/tmp/tmp.FQB46WMgMa/E---3.1_17006.p',cant_hold_and_let_go) ).
cnf(something_is_here_now,axiom,
at(something,here,now),
file('/export/starexec/sandbox2/tmp/tmp.FQB46WMgMa/E---3.1_17006.p',something_is_here_now) ).
cnf(answer_if_red_and_put_there,axiom,
( answer(X2)
| ~ red(X1)
| ~ put(X1,there,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.FQB46WMgMa/E---3.1_17006.p',answer_if_red_and_put_there) ).
cnf(prove_there_is_an_answer_situation,negated_conjecture,
~ answer(X1),
file('/export/starexec/sandbox2/tmp/tmp.FQB46WMgMa/E---3.1_17006.p',prove_there_is_an_answer_situation) ).
cnf(everything_is_red,axiom,
( red(X1)
| ~ at(X1,here,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.FQB46WMgMa/E---3.1_17006.p',everything_is_red) ).
cnf(c_0_10,axiom,
( put(X1,X4,go(X4,X3))
| ~ at(X1,X2,X3)
| ~ grabbed(X1,X3) ),
can_put_somewhere_if_grab_and_go_there ).
cnf(c_0_11,axiom,
( at(X1,X2,pick_up(X3))
| ~ at(X1,X2,X3) ),
situation_pick_up ).
cnf(c_0_12,plain,
( put(X1,X2,go(X2,pick_up(X3)))
| ~ grabbed(X1,pick_up(X3))
| ~ at(X1,X4,X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
( grabbed(X1,pick_up(go(X2,let_go(X3))))
| ~ at(X1,X2,X3) ),
can_grab_if_previously_let_go ).
cnf(c_0_14,axiom,
( held(X1,X2)
| at(X1,X3,go(X4,X2))
| ~ at(X1,X3,X2) ),
thing_either_held_or_went_there ).
cnf(c_0_15,axiom,
( at(X1,X2,let_go(X3))
| ~ at(X1,X2,X3) ),
situation_let_go ).
cnf(c_0_16,axiom,
~ held(X1,let_go(X2)),
cant_hold_and_let_go ).
cnf(c_0_17,plain,
( put(X1,X2,go(X2,pick_up(go(X3,let_go(X4)))))
| ~ at(X1,X5,go(X3,let_go(X4)))
| ~ at(X1,X3,X4) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( at(X1,X2,go(X3,let_go(X4)))
| ~ at(X1,X2,X4) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,plain,
( put(X1,X2,go(X2,pick_up(go(X3,let_go(X4)))))
| ~ at(X1,X3,X4)
| ~ at(X1,X5,X4) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,axiom,
at(something,here,now),
something_is_here_now ).
cnf(c_0_21,axiom,
( answer(X2)
| ~ red(X1)
| ~ put(X1,there,X2) ),
answer_if_red_and_put_there ).
cnf(c_0_22,negated_conjecture,
~ answer(X1),
prove_there_is_an_answer_situation ).
cnf(c_0_23,plain,
( put(something,X1,go(X1,pick_up(go(here,let_go(now)))))
| ~ at(something,X2,now) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,axiom,
( red(X1)
| ~ at(X1,here,X2) ),
everything_is_red ).
cnf(c_0_25,plain,
( ~ put(X1,there,X2)
| ~ red(X1) ),
inference(sr,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
put(something,X1,go(X1,pick_up(go(here,let_go(now))))),
inference(spm,[status(thm)],[c_0_23,c_0_20]) ).
cnf(c_0_27,plain,
red(something),
inference(spm,[status(thm)],[c_0_24,c_0_20]) ).
cnf(c_0_28,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MSC002-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 11:20:51 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.FQB46WMgMa/E---3.1_17006.p
% 0.20/0.50 # Version: 3.1pre001
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 17138 completed with status 0
% 0.20/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FGUNF-FFSF21-MFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.50 # Starting sh5l with 136s (1) cores
% 0.20/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 17146 completed with status 0
% 0.20/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FGUNF-FFSF21-MFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Unsatisfiable
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 14
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 14
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 14
% 0.20/0.50 # Processed clauses : 100
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 3
% 0.20/0.50 # ...remaining for further processing : 97
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 1
% 0.20/0.50 # Backward-rewritten : 1
% 0.20/0.50 # Generated clauses : 189
% 0.20/0.50 # ...of the previous two non-redundant : 182
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 189
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Total rewrite steps : 9
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 81
% 0.20/0.50 # Positive orientable unit clauses : 3
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 3
% 0.20/0.50 # Non-unit-clauses : 75
% 0.20/0.50 # Current number of unprocessed clauses: 110
% 0.20/0.50 # ...number of literals in the above : 343
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 16
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 609
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 560
% 0.20/0.50 # Non-unit clause-clause subsumptions : 3
% 0.20/0.50 # Unit Clause-clause subsumption calls : 18
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 2
% 0.20/0.50 # BW rewrite match successes : 1
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 4523
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.009 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.012 s
% 0.20/0.50 # Maximum resident set size: 1628 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.048 s
% 0.20/0.50 # System time : 0.009 s
% 0.20/0.50 # Total time : 0.057 s
% 0.20/0.50 # Maximum resident set size: 1684 pages
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------