TSTP Solution File: SWC239-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC239-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:02 EDT 2023
% Result : Unsatisfiable 0.68s 0.59s
% Output : CNFRefutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 32 ( 12 unt; 4 nHn; 32 RR)
% Number of literals : 75 ( 25 equ; 47 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_18,negated_conjecture,
( cons(sk6,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox/tmp/tmp.qu9cbTDAka/E---3.1_28338.p',co1_18) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.qu9cbTDAka/E---3.1_28338.p',co1_6) ).
cnf(co1_7,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox/tmp/tmp.qu9cbTDAka/E---3.1_28338.p',co1_7) ).
cnf(co1_10,negated_conjecture,
( memberP(X3,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
file('/export/starexec/sandbox/tmp/tmp.qu9cbTDAka/E---3.1_28338.p',co1_10) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.qu9cbTDAka/E---3.1_28338.p',clause71) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.qu9cbTDAka/E---3.1_28338.p',clause8) ).
cnf(co1_8,negated_conjecture,
( ssItem(sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
file('/export/starexec/sandbox/tmp/tmp.qu9cbTDAka/E---3.1_28338.p',co1_8) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.qu9cbTDAka/E---3.1_28338.p',clause74) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.qu9cbTDAka/E---3.1_28338.p',clause73) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/tmp/tmp.qu9cbTDAka/E---3.1_28338.p',co1_1) ).
cnf(co1_14,negated_conjecture,
( ssItem(sk6)
| nil = sk3 ),
file('/export/starexec/sandbox/tmp/tmp.qu9cbTDAka/E---3.1_28338.p',co1_14) ).
cnf(c_0_11,negated_conjecture,
( cons(sk6,nil) = sk3
| nil = sk3 ),
co1_18 ).
cnf(c_0_12,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_13,negated_conjecture,
nil != sk1,
co1_7 ).
cnf(c_0_14,negated_conjecture,
( memberP(X3,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
co1_10 ).
cnf(c_0_15,negated_conjecture,
sk1 = cons(sk6,nil),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_12]),c_0_13]) ).
cnf(c_0_16,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
clause71 ).
cnf(c_0_17,negated_conjecture,
( memberP(X1,sk5(X1,X2,X3))
| app(app(X2,cons(X3,nil)),X1) != cons(sk6,nil)
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,axiom,
ssList(nil),
clause8 ).
cnf(c_0_19,negated_conjecture,
( ssItem(sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
co1_8 ).
cnf(c_0_20,negated_conjecture,
( app(app(X1,cons(X2,nil)),nil) != cons(sk6,nil)
| ~ ssItem(sk5(nil,X1,X2))
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_21,negated_conjecture,
( ssItem(sk5(X1,X2,X3))
| app(app(X2,cons(X3,nil)),X1) != cons(sk6,nil)
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_22,negated_conjecture,
( app(app(X1,cons(X2,nil)),nil) != cons(sk6,nil)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_18])]) ).
cnf(c_0_23,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_24,negated_conjecture,
( app(cons(X1,nil),nil) != cons(sk6,nil)
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_18])]) ).
cnf(c_0_25,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_26,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_27,negated_conjecture,
( ssItem(sk6)
| nil = sk3 ),
co1_14 ).
cnf(c_0_28,negated_conjecture,
( cons(X1,nil) != cons(sk6,nil)
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
ssList(cons(sk6,nil)),
inference(rw,[status(thm)],[c_0_26,c_0_15]) ).
cnf(c_0_30,negated_conjecture,
ssItem(sk6),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_12]),c_0_13]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : SWC239-1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n029.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Oct 3 01:59:22 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.22/0.51 Running first-order theorem proving
% 0.22/0.51 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.qu9cbTDAka/E---3.1_28338.p
% 0.68/0.59 # Version: 3.1pre001
% 0.68/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.68/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.68/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.68/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.68/0.59 # Starting sh5l with 300s (1) cores
% 0.68/0.59 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 28458 completed with status 0
% 0.68/0.59 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.68/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.68/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.68/0.59 # No SInE strategy applied
% 0.68/0.59 # Search class: FGHSM-FSLM31-MFFFFFNN
% 0.68/0.59 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.68/0.59 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 675s (1) cores
% 0.68/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.68/0.59 # Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.68/0.59 # Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.68/0.59 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 136s (1) cores
% 0.68/0.59 # G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with pid 28469 completed with status 0
% 0.68/0.59 # Result found by G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y
% 0.68/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.68/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.68/0.59 # No SInE strategy applied
% 0.68/0.59 # Search class: FGHSM-FSLM31-MFFFFFNN
% 0.68/0.59 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.68/0.59 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 675s (1) cores
% 0.68/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.68/0.59 # Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.68/0.59 # Preprocessing time : 0.003 s
% 0.68/0.59 # Presaturation interreduction done
% 0.68/0.59
% 0.68/0.59 # Proof found!
% 0.68/0.59 # SZS status Unsatisfiable
% 0.68/0.59 # SZS output start CNFRefutation
% See solution above
% 0.68/0.59 # Parsed axioms : 205
% 0.68/0.59 # Removed by relevancy pruning/SinE : 0
% 0.68/0.59 # Initial clauses : 205
% 0.68/0.59 # Removed in clause preprocessing : 0
% 0.68/0.59 # Initial clauses in saturation : 205
% 0.68/0.59 # Processed clauses : 445
% 0.68/0.59 # ...of these trivial : 4
% 0.68/0.59 # ...subsumed : 19
% 0.68/0.59 # ...remaining for further processing : 422
% 0.68/0.59 # Other redundant clauses eliminated : 82
% 0.68/0.59 # Clauses deleted for lack of memory : 0
% 0.68/0.59 # Backward-subsumed : 4
% 0.68/0.59 # Backward-rewritten : 3
% 0.68/0.59 # Generated clauses : 899
% 0.68/0.59 # ...of the previous two non-redundant : 743
% 0.68/0.59 # ...aggressively subsumed : 0
% 0.68/0.59 # Contextual simplify-reflections : 4
% 0.68/0.59 # Paramodulations : 799
% 0.68/0.59 # Factorizations : 0
% 0.68/0.59 # NegExts : 0
% 0.68/0.59 # Equation resolutions : 99
% 0.68/0.59 # Total rewrite steps : 701
% 0.68/0.59 # Propositional unsat checks : 0
% 0.68/0.59 # Propositional check models : 0
% 0.68/0.59 # Propositional check unsatisfiable : 0
% 0.68/0.59 # Propositional clauses : 0
% 0.68/0.59 # Propositional clauses after purity: 0
% 0.68/0.59 # Propositional unsat core size : 0
% 0.68/0.59 # Propositional preprocessing time : 0.000
% 0.68/0.59 # Propositional encoding time : 0.000
% 0.68/0.59 # Propositional solver time : 0.000
% 0.68/0.59 # Success case prop preproc time : 0.000
% 0.68/0.59 # Success case prop encoding time : 0.000
% 0.68/0.59 # Success case prop solver time : 0.000
% 0.68/0.59 # Current number of processed clauses : 213
% 0.68/0.59 # Positive orientable unit clauses : 59
% 0.68/0.59 # Positive unorientable unit clauses: 0
% 0.68/0.59 # Negative unit clauses : 3
% 0.68/0.59 # Non-unit-clauses : 151
% 0.68/0.59 # Current number of unprocessed clauses: 698
% 0.68/0.59 # ...number of literals in the above : 4675
% 0.68/0.59 # Current number of archived formulas : 0
% 0.68/0.59 # Current number of archived clauses : 204
% 0.68/0.59 # Clause-clause subsumption calls (NU) : 11943
% 0.68/0.59 # Rec. Clause-clause subsumption calls : 1362
% 0.68/0.59 # Non-unit clause-clause subsumptions : 25
% 0.68/0.59 # Unit Clause-clause subsumption calls : 19
% 0.68/0.59 # Rewrite failures with RHS unbound : 0
% 0.68/0.59 # BW rewrite match attempts : 2
% 0.68/0.59 # BW rewrite match successes : 2
% 0.68/0.59 # Condensation attempts : 0
% 0.68/0.59 # Condensation successes : 0
% 0.68/0.59 # Termbank termtop insertions : 24552
% 0.68/0.59
% 0.68/0.59 # -------------------------------------------------
% 0.68/0.59 # User time : 0.053 s
% 0.68/0.59 # System time : 0.007 s
% 0.68/0.59 # Total time : 0.061 s
% 0.68/0.59 # Maximum resident set size: 2100 pages
% 0.68/0.59
% 0.68/0.59 # -------------------------------------------------
% 0.68/0.59 # User time : 0.248 s
% 0.68/0.59 # System time : 0.030 s
% 0.68/0.59 # Total time : 0.278 s
% 0.68/0.59 # Maximum resident set size: 1860 pages
% 0.68/0.59 % E---3.1 exiting
% 0.68/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------