TSTP Solution File: COM002-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : COM002-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 17:21:34 EDT 2023
% Result : Unsatisfiable 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 27 ( 16 unt; 0 nHn; 27 RR)
% Number of literals : 43 ( 0 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitivity_of_success,axiom,
( succeeds(X1,X2)
| ~ succeeds(X1,X3)
| ~ succeeds(X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.Z4wFKzdywN/E---3.1_12255.p',transitivity_of_success) ).
cnf(direct_success,axiom,
( succeeds(X1,X2)
| ~ follows(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.Z4wFKzdywN/E---3.1_12255.p',direct_success) ).
cnf(goto_success,axiom,
( succeeds(X1,X2)
| ~ has(X2,goto(X3))
| ~ labels(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.Z4wFKzdywN/E---3.1_12255.p',goto_success) ).
cnf(state_8,hypothesis,
has(p8,goto(loop)),
file('/export/starexec/sandbox/tmp/tmp.Z4wFKzdywN/E---3.1_12255.p',state_8) ).
cnf(transition_7_to_8,hypothesis,
follows(p8,p7),
file('/export/starexec/sandbox/tmp/tmp.Z4wFKzdywN/E---3.1_12255.p',transition_7_to_8) ).
cnf(label_state_3,hypothesis,
labels(loop,p3),
file('/export/starexec/sandbox/tmp/tmp.Z4wFKzdywN/E---3.1_12255.p',label_state_3) ).
cnf(transition_6_to_7,hypothesis,
follows(p7,p6),
file('/export/starexec/sandbox/tmp/tmp.Z4wFKzdywN/E---3.1_12255.p',transition_6_to_7) ).
cnf(transition_3_to_6,hypothesis,
follows(p6,p3),
file('/export/starexec/sandbox/tmp/tmp.Z4wFKzdywN/E---3.1_12255.p',transition_3_to_6) ).
cnf(prove_there_is_a_loop_through_p3,negated_conjecture,
~ succeeds(p3,p3),
file('/export/starexec/sandbox/tmp/tmp.Z4wFKzdywN/E---3.1_12255.p',prove_there_is_a_loop_through_p3) ).
cnf(c_0_9,axiom,
( succeeds(X1,X2)
| ~ succeeds(X1,X3)
| ~ succeeds(X3,X2) ),
transitivity_of_success ).
cnf(c_0_10,axiom,
( succeeds(X1,X2)
| ~ follows(X1,X2) ),
direct_success ).
cnf(c_0_11,axiom,
( succeeds(X1,X2)
| ~ has(X2,goto(X3))
| ~ labels(X3,X1) ),
goto_success ).
cnf(c_0_12,hypothesis,
has(p8,goto(loop)),
state_8 ).
cnf(c_0_13,plain,
( succeeds(X1,X2)
| ~ follows(X3,X2)
| ~ succeeds(X1,X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,hypothesis,
follows(p8,p7),
transition_7_to_8 ).
cnf(c_0_15,hypothesis,
( succeeds(X1,p8)
| ~ labels(loop,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,hypothesis,
labels(loop,p3),
label_state_3 ).
cnf(c_0_17,hypothesis,
follows(p7,p6),
transition_6_to_7 ).
cnf(c_0_18,hypothesis,
( succeeds(X1,p7)
| ~ succeeds(X1,p8) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,hypothesis,
succeeds(p3,p8),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,hypothesis,
follows(p6,p3),
transition_3_to_6 ).
cnf(c_0_21,hypothesis,
( succeeds(X1,p6)
| ~ succeeds(X1,p7) ),
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_22,hypothesis,
succeeds(p3,p7),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,hypothesis,
( succeeds(X1,p3)
| ~ succeeds(X1,p6) ),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_24,hypothesis,
succeeds(p3,p6),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
~ succeeds(p3,p3),
prove_there_is_a_loop_through_p3 ).
cnf(c_0_26,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : COM002-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n014.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Oct 3 04:54:04 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 0.21/0.50 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.Z4wFKzdywN/E---3.1_12255.p
% 0.21/0.51 # Version: 3.1pre001
% 0.21/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # new_bool_1 with pid 12407 completed with status 0
% 0.21/0.51 # Result found by new_bool_1
% 0.21/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51 # Search class: FHUNF-FFSM21-SFFFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.21/0.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 12414 completed with status 0
% 0.21/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.21/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51 # Search class: FHUNF-FFSM21-SFFFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Unsatisfiable
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 19
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 19
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 19
% 0.21/0.51 # Processed clauses : 55
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 0
% 0.21/0.51 # ...remaining for further processing : 55
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 0
% 0.21/0.51 # Backward-rewritten : 0
% 0.21/0.51 # Generated clauses : 29
% 0.21/0.51 # ...of the previous two non-redundant : 28
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 29
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Total rewrite steps : 0
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 36
% 0.21/0.51 # Positive orientable unit clauses : 18
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 4
% 0.21/0.51 # Non-unit-clauses : 14
% 0.21/0.51 # Current number of unprocessed clauses: 10
% 0.21/0.51 # ...number of literals in the above : 23
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 19
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 63
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 49
% 0.21/0.51 # Non-unit clause-clause subsumptions : 0
% 0.21/0.51 # Unit Clause-clause subsumption calls : 5
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 0
% 0.21/0.51 # BW rewrite match successes : 0
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 559
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.004 s
% 0.21/0.51 # System time : 0.001 s
% 0.21/0.51 # Total time : 0.005 s
% 0.21/0.51 # Maximum resident set size: 1648 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.006 s
% 0.21/0.51 # System time : 0.002 s
% 0.21/0.51 # Total time : 0.009 s
% 0.21/0.51 # Maximum resident set size: 1692 pages
% 0.21/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------