TSTP Solution File: COM001_1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : COM001_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:33 EDT 2023
% Result : Theorem 0.15s 0.41s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 15
% Syntax : Number of formulae : 31 ( 12 unt; 8 typ; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 31 ( 14 ~; 12 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 9 ( 5 >; 4 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 4 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 26 ( 0 sgn; 26 !; 0 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
p3: state ).
tff(decl_25,type,
p8: state ).
tff(decl_29,type,
loop: label ).
tff(decl_31,type,
goto: label > statement ).
tff(decl_33,type,
follows: ( state * state ) > $o ).
tff(decl_34,type,
succeeds: ( state * state ) > $o ).
tff(decl_35,type,
labels: ( label * state ) > $o ).
tff(decl_36,type,
has: ( state * statement ) > $o ).
tff(direct_success,axiom,
! [X1: state,X2: state] :
( follows(X2,X1)
=> succeeds(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.My01YnPEfB/E---3.1_22168.p',direct_success) ).
tff(goto_success,axiom,
! [X2: state,X4: label,X1: state] :
( ( has(X1,goto(X4))
& labels(X4,X2) )
=> succeeds(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.My01YnPEfB/E---3.1_22168.p',goto_success) ).
tff(transitivity_of_success,axiom,
! [X1: state,X3: state,X2: state] :
( ( succeeds(X2,X3)
& succeeds(X3,X1) )
=> succeeds(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.My01YnPEfB/E---3.1_22168.p',transitivity_of_success) ).
tff(transition_3_to_8,hypothesis,
follows(p8,p3),
file('/export/starexec/sandbox2/tmp/tmp.My01YnPEfB/E---3.1_22168.p',transition_3_to_8) ).
tff(state_8,hypothesis,
has(p8,goto(loop)),
file('/export/starexec/sandbox2/tmp/tmp.My01YnPEfB/E---3.1_22168.p',state_8) ).
tff(label_state_3,hypothesis,
labels(loop,p3),
file('/export/starexec/sandbox2/tmp/tmp.My01YnPEfB/E---3.1_22168.p',label_state_3) ).
tff(prove_there_is_a_loop_through_p3,conjecture,
succeeds(p3,p3),
file('/export/starexec/sandbox2/tmp/tmp.My01YnPEfB/E---3.1_22168.p',prove_there_is_a_loop_through_p3) ).
tff(c_0_7,plain,
! [X12: state,X13: state] :
( ~ follows(X13,X12)
| succeeds(X13,X12) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[direct_success])]) ).
tff(c_0_8,plain,
! [X6: state,X7: label,X8: state] :
( ~ has(X8,goto(X7))
| ~ labels(X7,X6)
| succeeds(X6,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[goto_success])]) ).
tff(c_0_9,plain,
! [X14: state,X15: state,X16: state] :
( ~ succeeds(X16,X15)
| ~ succeeds(X15,X14)
| succeeds(X16,X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_of_success])]) ).
tcf(c_0_10,plain,
! [X1: state,X2: state] :
( succeeds(X1,X2)
| ~ follows(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_11,hypothesis,
follows(p8,p3),
inference(split_conjunct,[status(thm)],[transition_3_to_8]) ).
tcf(c_0_12,plain,
! [X1: state,X4: label,X2: state] :
( succeeds(X2,X1)
| ~ has(X1,goto(X4))
| ~ labels(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_13,hypothesis,
has(p8,goto(loop)),
inference(split_conjunct,[status(thm)],[state_8]) ).
tcf(c_0_14,plain,
! [X1: state,X2: state,X3: state] :
( succeeds(X1,X3)
| ~ succeeds(X1,X2)
| ~ succeeds(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_15,hypothesis,
succeeds(p8,p3),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
tcf(c_0_16,hypothesis,
! [X1: state] :
( succeeds(X1,p8)
| ~ labels(loop,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
tcf(c_0_17,hypothesis,
labels(loop,p3),
inference(split_conjunct,[status(thm)],[label_state_3]) ).
tff(c_0_18,negated_conjecture,
~ succeeds(p3,p3),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_there_is_a_loop_through_p3])]) ).
tcf(c_0_19,hypothesis,
! [X1: state] :
( succeeds(X1,p3)
| ~ succeeds(X1,p8) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
tcf(c_0_20,hypothesis,
succeeds(p3,p8),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
tcf(c_0_21,negated_conjecture,
~ succeeds(p3,p3),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : COM001_1 : TPTP v8.1.2. Released v5.0.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n023.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Oct 3 05:14:52 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 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.My01YnPEfB/E---3.1_22168.p
% 0.15/0.41 # Version: 3.1pre001
% 0.15/0.41 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.41 # Starting sh5l with 300s (1) cores
% 0.15/0.41 # new_bool_3 with pid 22246 completed with status 0
% 0.15/0.41 # Result found by new_bool_3
% 0.15/0.41 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 # Search class: FHUNF-FFSM21-SFFFFFNN
% 0.15/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.15/0.41 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 22250 completed with status 0
% 0.15/0.41 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.15/0.41 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 # Search class: FHUNF-FFSM21-SFFFFFNN
% 0.15/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.15/0.41 # Preprocessing time : 0.001 s
% 0.15/0.41 # Presaturation interreduction done
% 0.15/0.41
% 0.15/0.41 # Proof found!
% 0.15/0.41 # SZS status Theorem
% 0.15/0.41 # SZS output start CNFRefutation
% See solution above
% 0.15/0.41 # Parsed axioms : 32
% 0.15/0.41 # Removed by relevancy pruning/SinE : 21
% 0.15/0.41 # Initial clauses : 11
% 0.15/0.41 # Removed in clause preprocessing : 0
% 0.15/0.41 # Initial clauses in saturation : 11
% 0.15/0.41 # Processed clauses : 30
% 0.15/0.41 # ...of these trivial : 0
% 0.15/0.41 # ...subsumed : 0
% 0.15/0.41 # ...remaining for further processing : 30
% 0.15/0.41 # Other redundant clauses eliminated : 0
% 0.15/0.41 # Clauses deleted for lack of memory : 0
% 0.15/0.41 # Backward-subsumed : 0
% 0.15/0.41 # Backward-rewritten : 0
% 0.15/0.41 # Generated clauses : 13
% 0.15/0.41 # ...of the previous two non-redundant : 12
% 0.15/0.41 # ...aggressively subsumed : 0
% 0.15/0.41 # Contextual simplify-reflections : 0
% 0.15/0.41 # Paramodulations : 13
% 0.15/0.41 # Factorizations : 0
% 0.15/0.41 # NegExts : 0
% 0.15/0.41 # Equation resolutions : 0
% 0.15/0.41 # Total rewrite steps : 0
% 0.15/0.41 # Propositional unsat checks : 0
% 0.15/0.41 # Propositional check models : 0
% 0.15/0.41 # Propositional check unsatisfiable : 0
% 0.15/0.41 # Propositional clauses : 0
% 0.15/0.41 # Propositional clauses after purity: 0
% 0.15/0.41 # Propositional unsat core size : 0
% 0.15/0.41 # Propositional preprocessing time : 0.000
% 0.15/0.41 # Propositional encoding time : 0.000
% 0.15/0.41 # Propositional solver time : 0.000
% 0.15/0.41 # Success case prop preproc time : 0.000
% 0.15/0.41 # Success case prop encoding time : 0.000
% 0.15/0.41 # Success case prop solver time : 0.000
% 0.15/0.41 # Current number of processed clauses : 19
% 0.15/0.41 # Positive orientable unit clauses : 11
% 0.15/0.41 # Positive unorientable unit clauses: 0
% 0.15/0.41 # Negative unit clauses : 1
% 0.15/0.41 # Non-unit-clauses : 7
% 0.15/0.41 # Current number of unprocessed clauses: 3
% 0.15/0.41 # ...number of literals in the above : 6
% 0.15/0.41 # Current number of archived formulas : 0
% 0.15/0.41 # Current number of archived clauses : 11
% 0.15/0.41 # Clause-clause subsumption calls (NU) : 23
% 0.15/0.41 # Rec. Clause-clause subsumption calls : 23
% 0.15/0.41 # Non-unit clause-clause subsumptions : 0
% 0.15/0.41 # Unit Clause-clause subsumption calls : 0
% 0.15/0.41 # Rewrite failures with RHS unbound : 0
% 0.15/0.41 # BW rewrite match attempts : 0
% 0.15/0.41 # BW rewrite match successes : 0
% 0.15/0.41 # Condensation attempts : 0
% 0.15/0.41 # Condensation successes : 0
% 0.15/0.41 # Termbank termtop insertions : 627
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.005 s
% 0.15/0.41 # System time : 0.000 s
% 0.15/0.41 # Total time : 0.005 s
% 0.15/0.41 # Maximum resident set size: 1744 pages
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.006 s
% 0.15/0.41 # System time : 0.002 s
% 0.15/0.41 # Total time : 0.008 s
% 0.15/0.41 # Maximum resident set size: 1748 pages
% 0.15/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------