TSTP Solution File: SYO629-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYO629-1 : TPTP v8.1.2. Released v7.1.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 20:46:31 EDT 2023
% Result : Unsatisfiable 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 11 unt; 7 nHn; 16 RR)
% Number of literals : 49 ( 0 equ; 24 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 28 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_10_06,axiom,
( 'E'('0',f(X2))
| 'LE'(f(X2),'0')
| ~ 'LE'(f(X1),s('0'))
| ~ iLEQ(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.kDVrKapSLA/E---3.1_28106.p',clause_10_06) ).
cnf(clause_7_05,axiom,
~ 'LE'(f(X1),'0'),
file('/export/starexec/sandbox2/tmp/tmp.kDVrKapSLA/E---3.1_28106.p',clause_7_05) ).
cnf(clause_6_04,axiom,
( 'E'(s('0'),f(X1))
| 'LE'(f(X1),s('0')) ),
file('/export/starexec/sandbox2/tmp/tmp.kDVrKapSLA/E---3.1_28106.p',clause_6_04) ).
cnf(clause_1_07,axiom,
( 'E'(f(X1),f(g(X1)))
| ~ 'E'(s('0'),f(X1))
| ~ 'E'(s('0'),f(g(X1))) ),
file('/export/starexec/sandbox2/tmp/tmp.kDVrKapSLA/E---3.1_28106.p',clause_1_07) ).
cnf(clause_8_01,axiom,
~ 'E'(f(X1),f(g(X1))),
file('/export/starexec/sandbox2/tmp/tmp.kDVrKapSLA/E---3.1_28106.p',clause_8_01) ).
cnf(clause_0_02,axiom,
iLEQ(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.kDVrKapSLA/E---3.1_28106.p',clause_0_02) ).
cnf(clause_3_09,axiom,
iLEQ(X1,g(X1)),
file('/export/starexec/sandbox2/tmp/tmp.kDVrKapSLA/E---3.1_28106.p',clause_3_09) ).
cnf(clause_11_03,axiom,
( 'E'(f(X1),f(g(X1)))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(g(X1))) ),
file('/export/starexec/sandbox2/tmp/tmp.kDVrKapSLA/E---3.1_28106.p',clause_11_03) ).
cnf(c_0_8,axiom,
( 'E'('0',f(X2))
| 'LE'(f(X2),'0')
| ~ 'LE'(f(X1),s('0'))
| ~ iLEQ(X1,X2) ),
clause_10_06 ).
cnf(c_0_9,axiom,
~ 'LE'(f(X1),'0'),
clause_7_05 ).
cnf(c_0_10,plain,
( 'E'('0',f(X1))
| ~ 'LE'(f(X2),s('0'))
| ~ iLEQ(X2,X1) ),
inference(sr,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
( 'E'(s('0'),f(X1))
| 'LE'(f(X1),s('0')) ),
clause_6_04 ).
cnf(c_0_12,axiom,
( 'E'(f(X1),f(g(X1)))
| ~ 'E'(s('0'),f(X1))
| ~ 'E'(s('0'),f(g(X1))) ),
clause_1_07 ).
cnf(c_0_13,axiom,
~ 'E'(f(X1),f(g(X1))),
clause_8_01 ).
cnf(c_0_14,plain,
( 'E'(s('0'),f(X1))
| 'E'('0',f(X2))
| ~ iLEQ(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,axiom,
iLEQ(X1,X1),
clause_0_02 ).
cnf(c_0_16,axiom,
iLEQ(X1,g(X1)),
clause_3_09 ).
cnf(c_0_17,axiom,
( 'E'(f(X1),f(g(X1)))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(g(X1))) ),
clause_11_03 ).
cnf(c_0_18,plain,
( ~ 'E'(s('0'),f(g(X1)))
| ~ 'E'(s('0'),f(X1)) ),
inference(sr,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( 'E'(s('0'),f(X1))
| 'E'('0',f(X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( 'E'('0',f(g(X1)))
| 'E'(s('0'),f(X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_21,plain,
( ~ 'E'('0',f(g(X1)))
| ~ 'E'('0',f(X1)) ),
inference(sr,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_22,plain,
'E'('0',f(g(X1))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_23,plain,
~ 'E'('0',f(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_24,plain,
$false,
inference(sr,[status(thm)],[c_0_22,c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO629-1 : TPTP v8.1.2. Released v7.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n026.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 16:19:44 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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.kDVrKapSLA/E---3.1_28106.p
% 0.20/0.49 # Version: 3.1pre001
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 28212 completed with status 0
% 0.20/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: FGUNM-FFSF11-SFFFFFNN
% 0.20/0.49 # partial match(1): FGUNF-FFSF11-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting SAT001_CO_MinMin_p005000_rr with 811s (1) cores
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.49 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.49 # Starting sh5l with 136s (1) cores
% 0.20/0.49 # SAT001_CO_MinMin_p005000_rr with pid 28218 completed with status 0
% 0.20/0.49 # Result found by SAT001_CO_MinMin_p005000_rr
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: FGUNM-FFSF11-SFFFFFNN
% 0.20/0.49 # partial match(1): FGUNF-FFSF11-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting SAT001_CO_MinMin_p005000_rr with 811s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Unsatisfiable
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 12
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 12
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 12
% 0.20/0.49 # Processed clauses : 25
% 0.20/0.49 # ...of these trivial : 2
% 0.20/0.49 # ...subsumed : 2
% 0.20/0.49 # ...remaining for further processing : 21
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 2
% 0.20/0.49 # Generated clauses : 7
% 0.20/0.49 # ...of the previous two non-redundant : 7
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 1
% 0.20/0.49 # Paramodulations : 5
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Total rewrite steps : 4
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 9
% 0.20/0.49 # Positive orientable unit clauses : 2
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 3
% 0.20/0.49 # Non-unit-clauses : 4
% 0.20/0.49 # Current number of unprocessed clauses: 1
% 0.20/0.49 # ...number of literals in the above : 2
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 12
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 6
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 6
% 0.20/0.49 # Non-unit clause-clause subsumptions : 1
% 0.20/0.49 # Unit Clause-clause subsumption calls : 1
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 1
% 0.20/0.49 # BW rewrite match successes : 1
% 0.20/0.49 # Condensation attempts : 25
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 464
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.001 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.005 s
% 0.20/0.49 # Maximum resident set size: 1656 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.011 s
% 0.20/0.49 # System time : 0.008 s
% 0.20/0.49 # Total time : 0.019 s
% 0.20/0.49 # Maximum resident set size: 1676 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------