TSTP Solution File: MSC001-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : MSC001-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:37:21 EDT 2023
% Result : Unsatisfiable 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 33 ( 11 unt; 3 nHn; 26 RR)
% Number of literals : 65 ( 0 equ; 38 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 73 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_11,axiom,
( answer(X2)
| ~ red(X1)
| ~ at(X1,there,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.VRKn5MpPJN/E---3.1_1025.p',clause_11) ).
cnf(prove_there_is_a_red_thing,negated_conjecture,
~ answer(X1),
file('/export/starexec/sandbox2/tmp/tmp.VRKn5MpPJN/E---3.1_1025.p',prove_there_is_a_red_thing) ).
cnf(clause_9,axiom,
( at(thing(X1),X3,X2)
| ~ hold(thing(X1),X2)
| ~ at(hand,X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.VRKn5MpPJN/E---3.1_1025.p',clause_9) ).
cnf(clause_13,axiom,
( hold(thing(X1),do(go(X3),X2))
| ~ hold(thing(X1),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.VRKn5MpPJN/E---3.1_1025.p',clause_13) ).
cnf(clause_8,axiom,
( hold(thing(taken(X2)),do(pick_up,X2))
| ~ at(hand,X1,X2)
| ~ at(thing(X3),X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.VRKn5MpPJN/E---3.1_1025.p',clause_8) ).
cnf(clause_14,axiom,
( at(thing(taken(X2)),X1,X2)
| ~ at(hand,X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.VRKn5MpPJN/E---3.1_1025.p',clause_14) ).
cnf(clause_5,axiom,
at(hand,X1,do(go(X1),X2)),
file('/export/starexec/sandbox2/tmp/tmp.VRKn5MpPJN/E---3.1_1025.p',clause_5) ).
cnf(clause_7,axiom,
( at(thing(X1),X2,X3)
| hold(thing(X1),X3)
| ~ at(thing(X1),X2,do(go(X2),X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.VRKn5MpPJN/E---3.1_1025.p',clause_7) ).
cnf(things_here_now_are_red,hypothesis,
( red(X1)
| ~ at(X1,here,now) ),
file('/export/starexec/sandbox2/tmp/tmp.VRKn5MpPJN/E---3.1_1025.p',things_here_now_are_red) ).
cnf(clause_17,axiom,
( at(X1,X2,X3)
| ~ at(X1,X2,do(let_go,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.VRKn5MpPJN/E---3.1_1025.p',clause_17) ).
cnf(clause_2,axiom,
~ hold(thing(X1),do(let_go,X2)),
file('/export/starexec/sandbox2/tmp/tmp.VRKn5MpPJN/E---3.1_1025.p',clause_2) ).
cnf(c_0_11,axiom,
( answer(X2)
| ~ red(X1)
| ~ at(X1,there,X2) ),
clause_11 ).
cnf(c_0_12,negated_conjecture,
~ answer(X1),
prove_there_is_a_red_thing ).
cnf(c_0_13,axiom,
( at(thing(X1),X3,X2)
| ~ hold(thing(X1),X2)
| ~ at(hand,X3,X2) ),
clause_9 ).
cnf(c_0_14,axiom,
( hold(thing(X1),do(go(X3),X2))
| ~ hold(thing(X1),X2) ),
clause_13 ).
cnf(c_0_15,plain,
( ~ red(X1)
| ~ at(X1,there,X2) ),
inference(sr,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( at(thing(X1),X2,do(go(X3),X4))
| ~ hold(thing(X1),X4)
| ~ at(hand,X2,do(go(X3),X4)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,axiom,
( hold(thing(taken(X2)),do(pick_up,X2))
| ~ at(hand,X1,X2)
| ~ at(thing(X3),X1,X2) ),
clause_8 ).
cnf(c_0_18,axiom,
( at(thing(taken(X2)),X1,X2)
| ~ at(hand,X1,X2) ),
clause_14 ).
cnf(c_0_19,plain,
( ~ red(thing(X1))
| ~ hold(thing(X1),X2)
| ~ at(hand,there,do(go(X3),X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,axiom,
at(hand,X1,do(go(X1),X2)),
clause_5 ).
cnf(c_0_21,plain,
( hold(thing(taken(X1)),do(pick_up,X1))
| ~ at(hand,X2,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( ~ red(thing(X1))
| ~ hold(thing(X1),X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
hold(thing(taken(do(go(X1),X2))),do(pick_up,do(go(X1),X2))),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_24,axiom,
( at(thing(X1),X2,X3)
| hold(thing(X1),X3)
| ~ at(thing(X1),X2,do(go(X2),X3)) ),
clause_7 ).
cnf(c_0_25,plain,
~ red(thing(taken(do(go(X1),X2)))),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,hypothesis,
( red(X1)
| ~ at(X1,here,now) ),
things_here_now_are_red ).
cnf(c_0_27,axiom,
( at(X1,X2,X3)
| ~ at(X1,X2,do(let_go,X3)) ),
clause_17 ).
cnf(c_0_28,plain,
( hold(thing(taken(do(go(X1),X2))),X2)
| at(thing(taken(do(go(X1),X2))),X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_18]),c_0_20])]) ).
cnf(c_0_29,axiom,
~ hold(thing(X1),do(let_go,X2)),
clause_2 ).
cnf(c_0_30,hypothesis,
~ at(thing(taken(do(go(X1),X2))),here,now),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
at(thing(taken(do(go(X1),do(let_go,X2)))),X1,X2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_32,hypothesis,
$false,
inference(spm,[status(thm)],[c_0_30,c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : MSC001-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n026.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 : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 11:38:44 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.VRKn5MpPJN/E---3.1_1025.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 # sh5l with pid 1172 completed with status 0
% 0.20/0.50 # Result found by sh5l
% 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 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.50 # Search class: FGHNF-FFSF21-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 181s (1) cores
% 0.20/0.50 # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with pid 1180 completed with status 0
% 0.20/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N
% 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 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.50 # Search class: FGHNF-FFSF21-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 181s (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.51 # Parsed axioms : 18
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 18
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 18
% 0.20/0.51 # Processed clauses : 95
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 21
% 0.20/0.51 # ...remaining for further processing : 74
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 2
% 0.20/0.51 # Backward-rewritten : 0
% 0.20/0.51 # Generated clauses : 146
% 0.20/0.51 # ...of the previous two non-redundant : 136
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 146
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Total rewrite steps : 4
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 54
% 0.20/0.51 # Positive orientable unit clauses : 4
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 8
% 0.20/0.51 # Non-unit-clauses : 42
% 0.20/0.51 # Current number of unprocessed clauses: 67
% 0.20/0.51 # ...number of literals in the above : 152
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 20
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 534
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 507
% 0.20/0.51 # Non-unit clause-clause subsumptions : 18
% 0.20/0.51 # Unit Clause-clause subsumption calls : 43
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 21
% 0.20/0.51 # BW rewrite match successes : 0
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 3471
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.008 s
% 0.20/0.51 # System time : 0.002 s
% 0.20/0.51 # Total time : 0.010 s
% 0.20/0.51 # Maximum resident set size: 1612 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.009 s
% 0.20/0.51 # System time : 0.004 s
% 0.20/0.51 # Total time : 0.013 s
% 0.20/0.51 # Maximum resident set size: 1684 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------