TSTP Solution File: SWC007-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC007-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:22:32 EDT 2024
% Result : Unsatisfiable 0.16s 0.49s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 22 ( 10 unt; 0 nHn; 22 RR)
% Number of literals : 48 ( 22 equ; 32 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X1,X2),X3) != sk2
| app(X1,X3) != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_7,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_5,negated_conjecture,
nil = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(c_0_7,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X1,X2),X3) != sk2
| app(X1,X3) != sk1 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_8,negated_conjecture,
sk1 = sk3,
co1_7 ).
cnf(c_0_9,negated_conjecture,
nil = sk3,
co1_5 ).
cnf(c_0_10,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X1,X2),X3) != sk2
| app(X1,X3) != sk1 ),
c_0_7 ).
cnf(c_0_11,negated_conjecture,
sk1 = nil,
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_13,negated_conjecture,
( app(app(X1,X2),X3) != sk2
| app(X1,X3) != nil
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_12 ).
cnf(c_0_15,axiom,
ssList(nil),
clause8 ).
cnf(c_0_16,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_17,negated_conjecture,
( app(nil,X1) != nil
| app(X2,X1) != sk2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_18,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
c_0_16 ).
cnf(c_0_19,negated_conjecture,
( app(X1,nil) != sk2
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_15])]) ).
cnf(c_0_20,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_18])]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC007-1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n005.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Sun May 19 03:13:07 EDT 2024
% 0.16/0.31 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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/benchmark/theBenchmark.p
% 0.16/0.49 # Version: 3.1.0
% 0.16/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.49 # Starting sh5l with 300s (1) cores
% 0.16/0.49 # new_bool_1 with pid 27899 completed with status 0
% 0.16/0.49 # Result found by new_bool_1
% 0.16/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.49 # Search class: FHHSF-FFMM22-SFFFFFNN
% 0.16/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.49 # SAT001_MinMin_p005000_rr_RG with pid 27902 completed with status 0
% 0.16/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.49 # Search class: FHHSF-FFMM22-SFFFFFNN
% 0.16/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.49 # Preprocessing time : 0.004 s
% 0.16/0.49 # Presaturation interreduction done
% 0.16/0.49
% 0.16/0.49 # Proof found!
% 0.16/0.49 # SZS status Unsatisfiable
% 0.16/0.49 # SZS output start CNFRefutation
% See solution above
% 0.16/0.49 # Parsed axioms : 193
% 0.16/0.49 # Removed by relevancy pruning/SinE : 168
% 0.16/0.49 # Initial clauses : 25
% 0.16/0.49 # Removed in clause preprocessing : 0
% 0.16/0.49 # Initial clauses in saturation : 25
% 0.16/0.49 # Processed clauses : 47
% 0.16/0.49 # ...of these trivial : 3
% 0.16/0.49 # ...subsumed : 2
% 0.16/0.49 # ...remaining for further processing : 42
% 0.16/0.49 # Other redundant clauses eliminated : 5
% 0.16/0.49 # Clauses deleted for lack of memory : 0
% 0.16/0.49 # Backward-subsumed : 0
% 0.16/0.49 # Backward-rewritten : 0
% 0.16/0.49 # Generated clauses : 22
% 0.16/0.49 # ...of the previous two non-redundant : 13
% 0.16/0.49 # ...aggressively subsumed : 0
% 0.16/0.49 # Contextual simplify-reflections : 0
% 0.16/0.49 # Paramodulations : 18
% 0.16/0.49 # Factorizations : 0
% 0.16/0.49 # NegExts : 0
% 0.16/0.49 # Equation resolutions : 5
% 0.16/0.49 # Disequality decompositions : 0
% 0.16/0.49 # Total rewrite steps : 28
% 0.16/0.49 # ...of those cached : 23
% 0.16/0.49 # Propositional unsat checks : 0
% 0.16/0.49 # Propositional check models : 0
% 0.16/0.49 # Propositional check unsatisfiable : 0
% 0.16/0.49 # Propositional clauses : 0
% 0.16/0.49 # Propositional clauses after purity: 0
% 0.16/0.49 # Propositional unsat core size : 0
% 0.16/0.49 # Propositional preprocessing time : 0.000
% 0.16/0.49 # Propositional encoding time : 0.000
% 0.16/0.49 # Propositional solver time : 0.000
% 0.16/0.49 # Success case prop preproc time : 0.000
% 0.16/0.49 # Success case prop encoding time : 0.000
% 0.16/0.49 # Success case prop solver time : 0.000
% 0.16/0.49 # Current number of processed clauses : 19
% 0.16/0.49 # Positive orientable unit clauses : 6
% 0.16/0.49 # Positive unorientable unit clauses: 0
% 0.16/0.49 # Negative unit clauses : 1
% 0.16/0.49 # Non-unit-clauses : 12
% 0.16/0.49 # Current number of unprocessed clauses: 11
% 0.16/0.49 # ...number of literals in the above : 46
% 0.16/0.49 # Current number of archived formulas : 0
% 0.16/0.49 # Current number of archived clauses : 22
% 0.16/0.49 # Clause-clause subsumption calls (NU) : 75
% 0.16/0.49 # Rec. Clause-clause subsumption calls : 33
% 0.16/0.49 # Non-unit clause-clause subsumptions : 0
% 0.16/0.49 # Unit Clause-clause subsumption calls : 2
% 0.16/0.49 # Rewrite failures with RHS unbound : 0
% 0.16/0.49 # BW rewrite match attempts : 0
% 0.16/0.49 # BW rewrite match successes : 0
% 0.16/0.49 # Condensation attempts : 0
% 0.16/0.49 # Condensation successes : 0
% 0.16/0.49 # Termbank termtop insertions : 2894
% 0.16/0.49 # Search garbage collected termcells : 928
% 0.16/0.49
% 0.16/0.49 # -------------------------------------------------
% 0.16/0.49 # User time : 0.004 s
% 0.16/0.49 # System time : 0.004 s
% 0.16/0.49 # Total time : 0.008 s
% 0.16/0.49 # Maximum resident set size: 1924 pages
% 0.16/0.49
% 0.16/0.49 # -------------------------------------------------
% 0.16/0.49 # User time : 0.006 s
% 0.16/0.49 # System time : 0.007 s
% 0.16/0.49 # Total time : 0.013 s
% 0.16/0.49 # Maximum resident set size: 1872 pages
% 0.16/0.49 % E---3.1 exiting
% 0.16/0.49 % E exiting
%------------------------------------------------------------------------------