TSTP Solution File: SWC292-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC292-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 19:40:16 EDT 2023
% Result : Unsatisfiable 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 30 ( 19 unt; 3 nHn; 30 RR)
% Number of literals : 46 ( 15 equ; 17 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.xrurWtTJiK/E---3.1_20950.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.xrurWtTJiK/E---3.1_20950.p',co1_5) ).
cnf(co1_7,negated_conjecture,
~ strictorderedP(sk1),
file('/export/starexec/sandbox2/tmp/tmp.xrurWtTJiK/E---3.1_20950.p',co1_7) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.xrurWtTJiK/E---3.1_20950.p',co1_6) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.xrurWtTJiK/E---3.1_20950.p',clause100) ).
cnf(co1_8,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox2/tmp/tmp.xrurWtTJiK/E---3.1_20950.p',co1_8) ).
cnf(clause3,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox2/tmp/tmp.xrurWtTJiK/E---3.1_20950.p',clause3) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.xrurWtTJiK/E---3.1_20950.p',clause8) ).
cnf(co1_10,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.xrurWtTJiK/E---3.1_20950.p',co1_10) ).
cnf(co1_9,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.xrurWtTJiK/E---3.1_20950.p',co1_9) ).
cnf(clause66,axiom,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.xrurWtTJiK/E---3.1_20950.p',clause66) ).
cnf(c_0_11,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_12,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_13,negated_conjecture,
~ strictorderedP(sk1),
co1_7 ).
cnf(c_0_14,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_15,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_16,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
~ strictorderedP(sk3),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( nil = sk3
| nil != sk4 ),
co1_8 ).
cnf(c_0_19,axiom,
strictorderedP(nil),
clause3 ).
cnf(c_0_20,negated_conjecture,
( X1 = sk4
| neq(sk4,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,axiom,
ssList(nil),
clause8 ).
cnf(c_0_22,negated_conjecture,
sk4 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_23,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
co1_10 ).
cnf(c_0_24,negated_conjecture,
neq(sk4,nil),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
co1_9 ).
cnf(c_0_26,axiom,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
clause66 ).
cnf(c_0_27,negated_conjecture,
cons(sk5,nil) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_28,negated_conjecture,
ssItem(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_24])]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC292-1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n003.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 : Tue Oct 3 02:05:18 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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.xrurWtTJiK/E---3.1_20950.p
% 0.21/0.51 # Version: 3.1pre001
% 0.21/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr 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_3 with pid 21073 completed with status 0
% 0.21/0.51 # Result found by new_bool_3
% 0.21/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 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: FGHSF-FFMM21-MFFFFFNN
% 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_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 21077 completed with status 0
% 0.21/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 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: FGHSF-FFMM21-MFFFFFNN
% 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_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.51 # Preprocessing time : 0.003 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 : 196
% 0.21/0.51 # Removed by relevancy pruning/SinE : 127
% 0.21/0.51 # Initial clauses : 69
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 69
% 0.21/0.51 # Processed clauses : 126
% 0.21/0.51 # ...of these trivial : 2
% 0.21/0.51 # ...subsumed : 5
% 0.21/0.51 # ...remaining for further processing : 119
% 0.21/0.51 # Other redundant clauses eliminated : 11
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 1
% 0.21/0.51 # Backward-rewritten : 3
% 0.21/0.51 # Generated clauses : 45
% 0.21/0.51 # ...of the previous two non-redundant : 38
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 35
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 11
% 0.21/0.51 # Total rewrite steps : 30
% 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 : 43
% 0.21/0.51 # Positive orientable unit clauses : 13
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 2
% 0.21/0.51 # Non-unit-clauses : 28
% 0.21/0.51 # Current number of unprocessed clauses: 39
% 0.21/0.51 # ...number of literals in the above : 190
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 66
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 1387
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 158
% 0.21/0.51 # Non-unit clause-clause subsumptions : 5
% 0.21/0.51 # Unit Clause-clause subsumption calls : 14
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 1
% 0.21/0.51 # BW rewrite match successes : 1
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 4087
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.008 s
% 0.21/0.51 # System time : 0.006 s
% 0.21/0.51 # Total time : 0.013 s
% 0.21/0.51 # Maximum resident set size: 1972 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.009 s
% 0.21/0.51 # System time : 0.008 s
% 0.21/0.51 # Total time : 0.017 s
% 0.21/0.51 # Maximum resident set size: 1848 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------