TSTP Solution File: COM133+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : COM133+1 : TPTP v8.1.2. Released v6.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:22:29 EDT 2023
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 8 unt; 0 def)
% Number of atoms : 116 ( 44 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 138 ( 53 ~; 49 |; 23 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 143 ( 7 sgn; 94 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('T-subst-abs-2',axiom,
! [X15,X20,X9,X11,X21,X10,X34] :
( ( X9 != X21
& ~ visFreeVar(X21,X11)
& vtcheck(X20,X11,X15)
& vtcheck(vbind(X9,X15,X20),vabs(X21,X10,veabs),X34) )
=> vtcheck(X20,vsubst(X9,X11,vabs(X21,X10,veabs)),X34) ),
file('/export/starexec/sandbox/tmp/tmp.5tLCGmTRlg/E---3.1_28555.p','T-subst-abs-2') ).
fof('T-subst-abs-3',axiom,
! [X15,X20,X9,X11,X21,X10,X34] :
( ( X9 != X21
& visFreeVar(X21,X11)
& vtcheck(X20,X11,X15)
& vtcheck(vbind(X9,X15,X20),vabs(X21,X10,veabs),X34) )
=> vtcheck(X20,vsubst(X9,X11,vabs(X21,X10,veabs)),X34) ),
file('/export/starexec/sandbox/tmp/tmp.5tLCGmTRlg/E---3.1_28555.p','T-subst-abs-3') ).
fof('T-subst-abs',conjecture,
! [X15,X20,X9,X11,X21,X10,X34] :
( ( vtcheck(X20,X11,X15)
& vtcheck(vbind(X9,X15,X20),vabs(X21,X10,veabs),X34) )
=> vtcheck(X20,vsubst(X9,X11,vabs(X21,X10,veabs)),X34) ),
file('/export/starexec/sandbox/tmp/tmp.5tLCGmTRlg/E---3.1_28555.p','T-subst-abs') ).
fof('T-Strong',axiom,
! [X9,X10,X20,X11,X15] :
( ( ~ visFreeVar(X9,X11)
& vtcheck(vbind(X9,X10,X20),X11,X15) )
=> vtcheck(X20,X11,X15) ),
file('/export/starexec/sandbox/tmp/tmp.5tLCGmTRlg/E---3.1_28555.p','T-Strong') ).
fof(subst3,axiom,
! [X11,X9,X1,X4,X6,X19,X21,X15,X12] :
( ( X1 = X9
& X4 = X11
& X6 = vabs(X21,X15,X12) )
=> ( X9 = X21
=> ( X19 = vsubst(X1,X4,X6)
=> X19 = vabs(X21,X15,X12) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.5tLCGmTRlg/E---3.1_28555.p',subst3) ).
fof(isFreeVar1,axiom,
! [X15,X1,X4,X9,X14,X11] :
( ( X1 = X14
& X4 = vabs(X9,X15,X11) )
=> ( ( ( X9 != X14
& visFreeVar(X14,X11) )
=> visFreeVar(X1,X4) )
& ( visFreeVar(X1,X4)
=> ( X9 != X14
& visFreeVar(X14,X11) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.5tLCGmTRlg/E---3.1_28555.p',isFreeVar1) ).
fof(c_0_6,plain,
! [X15,X20,X9,X11,X21,X10,X34] :
( ( X9 != X21
& ~ visFreeVar(X21,X11)
& vtcheck(X20,X11,X15)
& vtcheck(vbind(X9,X15,X20),vabs(X21,X10,veabs),X34) )
=> vtcheck(X20,vsubst(X9,X11,vabs(X21,X10,veabs)),X34) ),
inference(fof_simplification,[status(thm)],['T-subst-abs-2']) ).
fof(c_0_7,plain,
! [X130,X131,X132,X133,X134,X135,X136] :
( X132 = X134
| visFreeVar(X134,X133)
| ~ vtcheck(X131,X133,X130)
| ~ vtcheck(vbind(X132,X130,X131),vabs(X134,X135,veabs),X136)
| vtcheck(X131,vsubst(X132,X133,vabs(X134,X135,veabs)),X136) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
fof(c_0_8,plain,
! [X137,X138,X139,X140,X141,X142,X143] :
( X139 = X141
| ~ visFreeVar(X141,X140)
| ~ vtcheck(X138,X140,X137)
| ~ vtcheck(vbind(X139,X137,X138),vabs(X141,X142,veabs),X143)
| vtcheck(X138,vsubst(X139,X140,vabs(X141,X142,veabs)),X143) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['T-subst-abs-3'])]) ).
fof(c_0_9,negated_conjecture,
~ ! [X15,X20,X9,X11,X21,X10,X34] :
( ( vtcheck(X20,X11,X15)
& vtcheck(vbind(X9,X15,X20),vabs(X21,X10,veabs),X34) )
=> vtcheck(X20,vsubst(X9,X11,vabs(X21,X10,veabs)),X34) ),
inference(assume_negation,[status(cth)],['T-subst-abs']) ).
cnf(c_0_10,plain,
( X1 = X2
| visFreeVar(X2,X3)
| vtcheck(X4,vsubst(X1,X3,vabs(X2,X6,veabs)),X7)
| ~ vtcheck(X4,X3,X5)
| ~ vtcheck(vbind(X1,X5,X4),vabs(X2,X6,veabs),X7) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( X1 = X2
| vtcheck(X4,vsubst(X1,X3,vabs(X2,X6,veabs)),X7)
| ~ visFreeVar(X2,X3)
| ~ vtcheck(X4,X3,X5)
| ~ vtcheck(vbind(X1,X5,X4),vabs(X2,X6,veabs),X7) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,negated_conjecture,
( vtcheck(esk2_0,esk4_0,esk1_0)
& vtcheck(vbind(esk3_0,esk1_0,esk2_0),vabs(esk5_0,esk6_0,veabs),esk7_0)
& ~ vtcheck(esk2_0,vsubst(esk3_0,esk4_0,vabs(esk5_0,esk6_0,veabs)),esk7_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_13,plain,
! [X9,X10,X20,X11,X15] :
( ( ~ visFreeVar(X9,X11)
& vtcheck(vbind(X9,X10,X20),X11,X15) )
=> vtcheck(X20,X11,X15) ),
inference(fof_simplification,[status(thm)],['T-Strong']) ).
cnf(c_0_14,plain,
( X1 = X2
| vtcheck(X3,vsubst(X1,X4,vabs(X2,X5,veabs)),X6)
| ~ vtcheck(vbind(X1,X7,X3),vabs(X2,X5,veabs),X6)
| ~ vtcheck(X3,X4,X7) ),
inference(csr,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
vtcheck(vbind(esk3_0,esk1_0,esk2_0),vabs(esk5_0,esk6_0,veabs),esk7_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X96,X97,X98,X99,X100,X101,X102,X103,X104] :
( X98 != X97
| X99 != X96
| X100 != vabs(X102,X103,X104)
| X97 != X102
| X101 != vsubst(X98,X99,X100)
| X101 = vabs(X102,X103,X104) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[subst3])]) ).
fof(c_0_17,plain,
! [X56,X57,X58,X59,X60] :
( visFreeVar(X56,X59)
| ~ vtcheck(vbind(X56,X57,X58),X59,X60)
| vtcheck(X58,X59,X60) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])]) ).
fof(c_0_18,plain,
! [X154,X155,X156,X157,X158,X159] :
( ( X157 = X158
| ~ visFreeVar(X158,X159)
| visFreeVar(X155,X156)
| X155 != X158
| X156 != vabs(X157,X154,X159) )
& ( X157 != X158
| ~ visFreeVar(X155,X156)
| X155 != X158
| X156 != vabs(X157,X154,X159) )
& ( visFreeVar(X158,X159)
| ~ visFreeVar(X155,X156)
| X155 != X158
| X156 != vabs(X157,X154,X159) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[isFreeVar1])])]) ).
cnf(c_0_19,negated_conjecture,
( esk5_0 = esk3_0
| vtcheck(esk2_0,vsubst(esk3_0,X1,vabs(esk5_0,esk6_0,veabs)),esk7_0)
| ~ vtcheck(esk2_0,X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
vtcheck(esk2_0,esk4_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,negated_conjecture,
~ vtcheck(esk2_0,vsubst(esk3_0,esk4_0,vabs(esk5_0,esk6_0,veabs)),esk7_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,plain,
( X9 = vabs(X6,X7,X8)
| X1 != X2
| X3 != X4
| X5 != vabs(X6,X7,X8)
| X2 != X6
| X9 != vsubst(X1,X3,X5) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( visFreeVar(X1,X2)
| vtcheck(X4,X2,X5)
| ~ vtcheck(vbind(X1,X3,X4),X2,X5) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( X1 != X2
| ~ visFreeVar(X3,X4)
| X3 != X2
| X4 != vabs(X1,X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
esk5_0 = esk3_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_26,plain,
vsubst(X1,X2,vabs(X1,X3,X4)) = vabs(X1,X3,X4),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_22])])])])]) ).
cnf(c_0_27,negated_conjecture,
( vtcheck(esk2_0,vabs(esk5_0,esk6_0,veabs),esk7_0)
| visFreeVar(esk3_0,vabs(esk5_0,esk6_0,veabs)) ),
inference(spm,[status(thm)],[c_0_23,c_0_15]) ).
cnf(c_0_28,plain,
~ visFreeVar(X1,vabs(X1,X2,X3)),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_24])])]) ).
cnf(c_0_29,negated_conjecture,
~ vtcheck(esk2_0,vabs(esk3_0,esk6_0,veabs),esk7_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_25]),c_0_26]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_25]),c_0_28]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : COM133+1 : TPTP v8.1.2. Released v6.4.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n023.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Oct 3 05:17:07 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.5tLCGmTRlg/E---3.1_28555.p
% 0.21/0.51 # Version: 3.1pre001
% 0.21/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S 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 28714 completed with status 0
% 0.21/0.51 # Result found by new_bool_3
% 0.21/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S 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-FFMF32-SFFFFFNN
% 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 28721 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: FSLSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S 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-FFMF32-SFFFFFNN
% 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.002 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 62
% 0.21/0.51 # Removed by relevancy pruning/SinE : 38
% 0.21/0.51 # Initial clauses : 40
% 0.21/0.51 # Removed in clause preprocessing : 4
% 0.21/0.51 # Initial clauses in saturation : 36
% 0.21/0.51 # Processed clauses : 111
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 4
% 0.21/0.51 # ...remaining for further processing : 106
% 0.21/0.51 # Other redundant clauses eliminated : 42
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 1
% 0.21/0.51 # Backward-rewritten : 2
% 0.21/0.51 # Generated clauses : 95
% 0.21/0.51 # ...of the previous two non-redundant : 80
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 1
% 0.21/0.51 # Paramodulations : 71
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 51
% 0.21/0.51 # Total rewrite steps : 12
% 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 : 53
% 0.21/0.51 # Positive orientable unit clauses : 7
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 12
% 0.21/0.51 # Non-unit-clauses : 34
% 0.21/0.51 # Current number of unprocessed clauses: 40
% 0.21/0.51 # ...number of literals in the above : 103
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 38
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 403
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 261
% 0.21/0.51 # Non-unit clause-clause subsumptions : 6
% 0.21/0.51 # Unit Clause-clause subsumption calls : 37
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 13
% 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 : 5261
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.010 s
% 0.21/0.51 # System time : 0.004 s
% 0.21/0.51 # Total time : 0.014 s
% 0.21/0.51 # Maximum resident set size: 1924 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.012 s
% 0.21/0.51 # System time : 0.007 s
% 0.21/0.51 # Total time : 0.019 s
% 0.21/0.51 # Maximum resident set size: 1808 pages
% 0.21/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------