TSTP Solution File: SWC198+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC198+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:28:16 EDT 2024
% Result : Theorem 0.17s 0.49s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 7 unt; 0 def)
% Number of atoms : 145 ( 46 equ)
% Maximal formula atoms : 34 ( 5 avg)
% Number of connectives : 178 ( 62 ~; 64 |; 34 &)
% ( 1 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 43 ( 1 sgn 23 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X1,X6)
| X5 = X6 ) ) )
| ( ! [X7] :
( ssItem(X7)
=> ( cons(X7,nil) != X3
| ~ memberP(X4,X7)
| ? [X8] :
( ssItem(X8)
& X7 != X8
& memberP(X4,X8)
& leq(X7,X8) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(ax37,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(cons(X2,X3),X1)
<=> ( X1 = X2
| memberP(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax37) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax2,axiom,
? [X1] :
( ssItem(X1)
& ? [X2] :
( ssItem(X2)
& X1 != X2 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax2) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X1,X6)
| X5 = X6 ) ) )
| ( ! [X7] :
( ssItem(X7)
=> ( cons(X7,nil) != X3
| ~ memberP(X4,X7)
| ? [X8] :
( ssItem(X8)
& X7 != X8
& memberP(X4,X8)
& leq(X7,X8) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_6,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
fof(c_0_7,plain,
! [X156,X157,X158] :
( ( ~ memberP(cons(X157,X158),X156)
| X156 = X157
| memberP(X158,X156)
| ~ ssList(X158)
| ~ ssItem(X157)
| ~ ssItem(X156) )
& ( X156 != X157
| memberP(cons(X157,X158),X156)
| ~ ssList(X158)
| ~ ssItem(X157)
| ~ ssItem(X156) )
& ( ~ memberP(X158,X156)
| memberP(cons(X157,X158),X156)
| ~ ssList(X158)
| ~ ssItem(X157)
| ~ ssItem(X156) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])])])]) ).
fof(c_0_8,negated_conjecture,
! [X257,X260] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ( ssItem(esk52_1(X257))
| ~ ssItem(X257) )
& ( memberP(esk48_0,esk52_1(X257))
| ~ ssItem(X257) )
& ( X257 != esk52_1(X257)
| ~ ssItem(X257) )
& ( nil = esk51_0
| ssItem(esk53_0) )
& ( nil = esk50_0
| ssItem(esk53_0) )
& ( nil = esk51_0
| cons(esk53_0,nil) = esk50_0 )
& ( nil = esk50_0
| cons(esk53_0,nil) = esk50_0 )
& ( nil = esk51_0
| memberP(esk51_0,esk53_0) )
& ( nil = esk50_0
| memberP(esk51_0,esk53_0) )
& ( nil = esk51_0
| ~ ssItem(X260)
| esk53_0 = X260
| ~ memberP(esk51_0,X260)
| ~ leq(esk53_0,X260) )
& ( nil = esk50_0
| ~ ssItem(X260)
| esk53_0 = X260
| ~ memberP(esk51_0,X260)
| ~ leq(esk53_0,X260) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])]) ).
fof(c_0_9,plain,
! [X159] :
( ~ ssItem(X159)
| ~ memberP(nil,X159) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_10,plain,
( X3 = X1
| memberP(X2,X3)
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( nil = esk50_0
| cons(esk53_0,nil) = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_13,negated_conjecture,
( nil = esk50_0
| ssItem(esk53_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
( memberP(esk48_0,esk52_1(X1))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
( esk50_0 = nil
| esk53_0 = X1
| ~ memberP(esk50_0,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),c_0_13]),c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( memberP(esk50_0,esk52_1(X1))
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( ssItem(esk52_1(X1))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,negated_conjecture,
( X1 != esk52_1(X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,negated_conjecture,
( esk52_1(X1) = esk53_0
| esk50_0 = nil
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
fof(c_0_22,plain,
? [X1] :
( ssItem(X1)
& ? [X2] :
( ssItem(X2)
& X1 != X2 ) ),
inference(fof_simplification,[status(thm)],[ax2]) ).
cnf(c_0_23,negated_conjecture,
esk50_0 = nil,
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21])]),c_0_13]) ).
fof(c_0_24,plain,
( ssItem(esk1_0)
& ssItem(esk2_0)
& esk1_0 != esk2_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_22])])]) ).
cnf(c_0_25,negated_conjecture,
( memberP(nil,esk52_1(X1))
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_26,plain,
ssItem(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_27,negated_conjecture,
~ ssItem(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_25]),c_0_19]) ).
cnf(c_0_28,plain,
$false,
inference(sr,[status(thm)],[c_0_26,c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWC198+1 : TPTP v8.2.0. Released v2.4.0.
% 0.00/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n023.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun May 19 03:53:23 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.49 # Version: 3.1.0
% 0.17/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.49 # Starting sh5l with 300s (1) cores
% 0.17/0.49 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 19568 completed with status 0
% 0.17/0.49 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.17/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.49 # No SInE strategy applied
% 0.17/0.49 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.17/0.49 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.49 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.17/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.17/0.49 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.17/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.17/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.17/0.49 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 19579 completed with status 0
% 0.17/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 0.17/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.49 # No SInE strategy applied
% 0.17/0.49 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.17/0.49 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.49 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.17/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.17/0.49 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.17/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.17/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.17/0.49 # Preprocessing time : 0.003 s
% 0.17/0.49 # Presaturation interreduction done
% 0.17/0.49
% 0.17/0.49 # Proof found!
% 0.17/0.49 # SZS status Theorem
% 0.17/0.49 # SZS output start CNFRefutation
% See solution above
% 0.17/0.49 # Parsed axioms : 96
% 0.17/0.49 # Removed by relevancy pruning/SinE : 0
% 0.17/0.49 # Initial clauses : 207
% 0.17/0.49 # Removed in clause preprocessing : 2
% 0.17/0.49 # Initial clauses in saturation : 205
% 0.17/0.49 # Processed clauses : 559
% 0.17/0.49 # ...of these trivial : 7
% 0.17/0.49 # ...subsumed : 86
% 0.17/0.49 # ...remaining for further processing : 466
% 0.17/0.49 # Other redundant clauses eliminated : 56
% 0.17/0.49 # Clauses deleted for lack of memory : 0
% 0.17/0.49 # Backward-subsumed : 70
% 0.17/0.49 # Backward-rewritten : 55
% 0.17/0.49 # Generated clauses : 693
% 0.17/0.49 # ...of the previous two non-redundant : 559
% 0.17/0.49 # ...aggressively subsumed : 0
% 0.17/0.49 # Contextual simplify-reflections : 37
% 0.17/0.49 # Paramodulations : 632
% 0.17/0.49 # Factorizations : 0
% 0.17/0.49 # NegExts : 0
% 0.17/0.49 # Equation resolutions : 61
% 0.17/0.49 # Disequality decompositions : 0
% 0.17/0.49 # Total rewrite steps : 383
% 0.17/0.49 # ...of those cached : 364
% 0.17/0.49 # Propositional unsat checks : 0
% 0.17/0.49 # Propositional check models : 0
% 0.17/0.49 # Propositional check unsatisfiable : 0
% 0.17/0.49 # Propositional clauses : 0
% 0.17/0.49 # Propositional clauses after purity: 0
% 0.17/0.49 # Propositional unsat core size : 0
% 0.17/0.49 # Propositional preprocessing time : 0.000
% 0.17/0.49 # Propositional encoding time : 0.000
% 0.17/0.49 # Propositional solver time : 0.000
% 0.17/0.49 # Success case prop preproc time : 0.000
% 0.17/0.49 # Success case prop encoding time : 0.000
% 0.17/0.49 # Success case prop solver time : 0.000
% 0.17/0.49 # Current number of processed clauses : 117
% 0.17/0.49 # Positive orientable unit clauses : 18
% 0.17/0.49 # Positive unorientable unit clauses: 0
% 0.17/0.49 # Negative unit clauses : 3
% 0.17/0.49 # Non-unit-clauses : 96
% 0.17/0.49 # Current number of unprocessed clauses: 400
% 0.17/0.49 # ...number of literals in the above : 2500
% 0.17/0.49 # Current number of archived formulas : 0
% 0.17/0.49 # Current number of archived clauses : 326
% 0.17/0.49 # Clause-clause subsumption calls (NU) : 17724
% 0.17/0.49 # Rec. Clause-clause subsumption calls : 4856
% 0.17/0.49 # Non-unit clause-clause subsumptions : 124
% 0.17/0.49 # Unit Clause-clause subsumption calls : 162
% 0.17/0.49 # Rewrite failures with RHS unbound : 0
% 0.17/0.49 # BW rewrite match attempts : 4
% 0.17/0.49 # BW rewrite match successes : 4
% 0.17/0.49 # Condensation attempts : 0
% 0.17/0.49 # Condensation successes : 0
% 0.17/0.49 # Termbank termtop insertions : 29663
% 0.17/0.49 # Search garbage collected termcells : 4378
% 0.17/0.49
% 0.17/0.49 # -------------------------------------------------
% 0.17/0.49 # User time : 0.035 s
% 0.17/0.49 # System time : 0.005 s
% 0.17/0.49 # Total time : 0.040 s
% 0.17/0.49 # Maximum resident set size: 2484 pages
% 0.17/0.49
% 0.17/0.49 # -------------------------------------------------
% 0.17/0.49 # User time : 0.154 s
% 0.17/0.49 # System time : 0.015 s
% 0.17/0.49 # Total time : 0.168 s
% 0.17/0.49 # Maximum resident set size: 1824 pages
% 0.17/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------