TSTP Solution File: SWC227-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC227-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:39:58 EDT 2023
% Result : Unsatisfiable 0.40s 0.63s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 31 ( 11 unt; 2 nHn; 27 RR)
% Number of literals : 78 ( 21 equ; 54 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; 2 con; 0-3 aty)
% Number of variables : 41 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.zUtYlzG6VG/E---3.1_10854.p',clause71) ).
cnf(co1_9,negated_conjecture,
( memberP(X2,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
file('/export/starexec/sandbox/tmp/tmp.zUtYlzG6VG/E---3.1_10854.p',co1_9) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.zUtYlzG6VG/E---3.1_10854.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.zUtYlzG6VG/E---3.1_10854.p',co1_8) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.zUtYlzG6VG/E---3.1_10854.p',clause74) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.zUtYlzG6VG/E---3.1_10854.p',clause120) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.zUtYlzG6VG/E---3.1_10854.p',clause86) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.zUtYlzG6VG/E---3.1_10854.p',clause109) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox/tmp/tmp.zUtYlzG6VG/E---3.1_10854.p',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox/tmp/tmp.zUtYlzG6VG/E---3.1_10854.p',clause13) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/tmp/tmp.zUtYlzG6VG/E---3.1_10854.p',co1_1) ).
cnf(co1_7,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox/tmp/tmp.zUtYlzG6VG/E---3.1_10854.p',co1_7) ).
cnf(c_0_12,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
clause71 ).
cnf(c_0_13,negated_conjecture,
( memberP(X2,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
co1_9 ).
cnf(c_0_14,axiom,
ssList(nil),
clause8 ).
cnf(c_0_15,negated_conjecture,
( app(app(nil,cons(X1,nil)),X2) != sk1
| ~ ssItem(sk5(X2,nil,X1))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_16,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_17,negated_conjecture,
( app(app(nil,cons(X1,nil)),X2) != sk1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_14])]) ).
cnf(c_0_18,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_19,negated_conjecture,
( app(cons(X1,nil),X2) != sk1
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_21,negated_conjecture,
( cons(X1,X2) != sk1
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_23,negated_conjecture,
( cons(X1,X2) != sk1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_14])]) ).
cnf(c_0_24,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause109 ).
cnf(c_0_25,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_26,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_27,negated_conjecture,
( nil = X1
| X1 != sk1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_28,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_29,negated_conjecture,
nil != sk1,
co1_7 ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.15 % Problem : SWC227-1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.16 % Command : run_E %s %d THM
% 0.15/0.38 % Computer : n022.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 2400
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Tue Oct 3 02:03:09 EDT 2023
% 0.15/0.38 % CPUTime :
% 0.23/0.54 Running first-order theorem proving
% 0.23/0.54 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.zUtYlzG6VG/E---3.1_10854.p
% 0.40/0.63 # Version: 3.1pre001
% 0.40/0.63 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.40/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.40/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.40/0.63 # Starting new_bool_1 with 300s (1) cores
% 0.40/0.63 # Starting sh5l with 300s (1) cores
% 0.40/0.63 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 10932 completed with status 0
% 0.40/0.63 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.40/0.63 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.40/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.40/0.63 # No SInE strategy applied
% 0.40/0.63 # Search class: FGHSM-FSLM31-MFFFFFNN
% 0.40/0.63 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.40/0.63 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 675s (1) cores
% 0.40/0.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.40/0.63 # Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.40/0.63 # Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.40/0.63 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 136s (1) cores
% 0.40/0.63 # G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with pid 10940 completed with status 0
% 0.40/0.63 # Result found by G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y
% 0.40/0.63 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.40/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.40/0.63 # No SInE strategy applied
% 0.40/0.63 # Search class: FGHSM-FSLM31-MFFFFFNN
% 0.40/0.63 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.40/0.63 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 675s (1) cores
% 0.40/0.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.40/0.63 # Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.40/0.63 # Preprocessing time : 0.003 s
% 0.40/0.63 # Presaturation interreduction done
% 0.40/0.63
% 0.40/0.63 # Proof found!
% 0.40/0.63 # SZS status Unsatisfiable
% 0.40/0.63 # SZS output start CNFRefutation
% See solution above
% 0.40/0.63 # Parsed axioms : 204
% 0.40/0.63 # Removed by relevancy pruning/SinE : 0
% 0.40/0.63 # Initial clauses : 204
% 0.40/0.63 # Removed in clause preprocessing : 0
% 0.40/0.63 # Initial clauses in saturation : 204
% 0.40/0.63 # Processed clauses : 760
% 0.40/0.63 # ...of these trivial : 4
% 0.40/0.63 # ...subsumed : 161
% 0.40/0.63 # ...remaining for further processing : 595
% 0.40/0.63 # Other redundant clauses eliminated : 82
% 0.40/0.63 # Clauses deleted for lack of memory : 0
% 0.40/0.63 # Backward-subsumed : 27
% 0.40/0.63 # Backward-rewritten : 0
% 0.40/0.63 # Generated clauses : 1819
% 0.40/0.63 # ...of the previous two non-redundant : 1591
% 0.40/0.63 # ...aggressively subsumed : 0
% 0.40/0.63 # Contextual simplify-reflections : 12
% 0.40/0.63 # Paramodulations : 1718
% 0.40/0.63 # Factorizations : 0
% 0.40/0.63 # NegExts : 0
% 0.40/0.63 # Equation resolutions : 101
% 0.40/0.63 # Total rewrite steps : 1493
% 0.40/0.63 # Propositional unsat checks : 0
% 0.40/0.63 # Propositional check models : 0
% 0.40/0.63 # Propositional check unsatisfiable : 0
% 0.40/0.63 # Propositional clauses : 0
% 0.40/0.63 # Propositional clauses after purity: 0
% 0.40/0.63 # Propositional unsat core size : 0
% 0.40/0.63 # Propositional preprocessing time : 0.000
% 0.40/0.63 # Propositional encoding time : 0.000
% 0.40/0.63 # Propositional solver time : 0.000
% 0.40/0.63 # Success case prop preproc time : 0.000
% 0.40/0.63 # Success case prop encoding time : 0.000
% 0.40/0.63 # Success case prop solver time : 0.000
% 0.40/0.63 # Current number of processed clauses : 366
% 0.40/0.63 # Positive orientable unit clauses : 62
% 0.40/0.63 # Positive unorientable unit clauses: 0
% 0.40/0.63 # Negative unit clauses : 5
% 0.40/0.63 # Non-unit-clauses : 299
% 0.40/0.63 # Current number of unprocessed clauses: 1186
% 0.40/0.63 # ...number of literals in the above : 7021
% 0.40/0.63 # Current number of archived formulas : 0
% 0.40/0.63 # Current number of archived clauses : 224
% 0.40/0.63 # Clause-clause subsumption calls (NU) : 19050
% 0.40/0.63 # Rec. Clause-clause subsumption calls : 3882
% 0.40/0.63 # Non-unit clause-clause subsumptions : 126
% 0.40/0.63 # Unit Clause-clause subsumption calls : 223
% 0.40/0.63 # Rewrite failures with RHS unbound : 0
% 0.40/0.63 # BW rewrite match attempts : 0
% 0.40/0.63 # BW rewrite match successes : 0
% 0.40/0.63 # Condensation attempts : 0
% 0.40/0.63 # Condensation successes : 0
% 0.40/0.63 # Termbank termtop insertions : 38266
% 0.40/0.63
% 0.40/0.63 # -------------------------------------------------
% 0.40/0.63 # User time : 0.070 s
% 0.40/0.63 # System time : 0.005 s
% 0.40/0.63 # Total time : 0.075 s
% 0.40/0.63 # Maximum resident set size: 2100 pages
% 0.40/0.63
% 0.40/0.63 # -------------------------------------------------
% 0.40/0.63 # User time : 0.306 s
% 0.40/0.63 # System time : 0.027 s
% 0.40/0.63 # Total time : 0.333 s
% 0.40/0.63 # Maximum resident set size: 1860 pages
% 0.40/0.63 % E---3.1 exiting
% 0.40/0.63 % E---3.1 exiting
%------------------------------------------------------------------------------