TSTP Solution File: COM133+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : COM133+1 : TPTP v8.1.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n004.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 : 600s
% DateTime : Fri Jul 15 01:14:30 EDT 2022
% Result : Theorem 0.29s 1.47s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 9 unt; 0 def)
% Number of atoms : 121 ( 28 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 138 ( 54 ~; 54 |; 20 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 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 : 155 ( 11 sgn 90 !; 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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','T-subst-abs') ).
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/sandbox2/benchmark/Axioms/COM001+0.ax',isFreeVar1) ).
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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','T-Strong') ).
fof('T-Weak-FreeVar',axiom,
! [X9,X10,X20,X11,X15] :
( ( ~ visFreeVar(X9,X11)
& vtcheck(X20,X11,X15) )
=> vtcheck(vbind(X9,X10,X20),X11,X15) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','T-Weak-FreeVar') ).
fof('T-subst-abs-1',axiom,
! [X15,X20,X9,X11,X21,X10,X12,X34] :
( ( X9 = X21
& vtcheck(X20,X11,X15)
& vtcheck(vbind(X9,X15,X20),vabs(X21,X10,X12),X34) )
=> vtcheck(X20,vsubst(X9,X11,vabs(X21,X10,X12)),X34) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','T-subst-abs-1') ).
fof(c_0_7,plain,
! [X35,X36,X37,X38,X39,X40,X41] :
( X37 = X39
| visFreeVar(X39,X38)
| ~ vtcheck(X36,X38,X35)
| ~ vtcheck(vbind(X37,X35,X36),vabs(X39,X40,veabs),X41)
| vtcheck(X36,vsubst(X37,X38,vabs(X39,X40,veabs)),X41) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],['T-subst-abs-2'])])]) ).
fof(c_0_8,plain,
! [X35,X36,X37,X38,X39,X40,X41] :
( X37 = X39
| ~ visFreeVar(X39,X38)
| ~ vtcheck(X36,X38,X35)
| ~ vtcheck(vbind(X37,X35,X36),vabs(X39,X40,veabs),X41)
| vtcheck(X36,vsubst(X37,X38,vabs(X39,X40,veabs)),X41) ),
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,
( vtcheck(X1,vsubst(X2,X3,vabs(X4,X5,veabs)),X6)
| visFreeVar(X4,X3)
| X2 = X4
| ~ vtcheck(vbind(X2,X7,X1),vabs(X4,X5,veabs),X6)
| ~ vtcheck(X1,X3,X7) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( vtcheck(X1,vsubst(X2,X3,vabs(X4,X5,veabs)),X6)
| X2 = X4
| ~ vtcheck(vbind(X2,X7,X1),vabs(X4,X5,veabs),X6)
| ~ vtcheck(X1,X3,X7)
| ~ visFreeVar(X4,X3) ),
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,
! [X16,X17,X18,X19,X20,X21] :
( ( X19 = X20
| ~ visFreeVar(X20,X21)
| visFreeVar(X17,X18)
| X17 != X20
| X18 != vabs(X19,X16,X21) )
& ( X19 != X20
| ~ visFreeVar(X17,X18)
| X17 != X20
| X18 != vabs(X19,X16,X21) )
& ( visFreeVar(X20,X21)
| ~ visFreeVar(X17,X18)
| X17 != X20
| X18 != vabs(X19,X16,X21) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[isFreeVar1])])]) ).
fof(c_0_14,plain,
! [X21,X22,X23,X24,X25] :
( visFreeVar(X21,X24)
| ~ vtcheck(vbind(X21,X22,X23),X24,X25)
| vtcheck(X23,X24,X25) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],['T-Strong'])])]) ).
cnf(c_0_15,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_16,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]) ).
cnf(c_0_17,plain,
( X1 != vabs(X2,X3,X4)
| X5 != X6
| ~ visFreeVar(X5,X1)
| X2 != X6 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( vtcheck(X1,X2,X3)
| visFreeVar(X4,X2)
| ~ vtcheck(vbind(X4,X5,X1),X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,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_20,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_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
vtcheck(esk2_0,esk4_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,plain,
( X1 != vabs(X2,X3,X4)
| ~ visFreeVar(X2,X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_17])]) ).
fof(c_0_23,plain,
! [X21,X22,X23,X24,X25] :
( visFreeVar(X21,X24)
| ~ vtcheck(X23,X24,X25)
| vtcheck(vbind(X21,X22,X23),X24,X25) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],['T-Weak-FreeVar'])])]) ).
cnf(c_0_24,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_18,c_0_16]) ).
cnf(c_0_25,negated_conjecture,
esk5_0 = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_26,plain,
~ visFreeVar(X1,vabs(X1,X2,X3)),
inference(er,[status(thm)],[c_0_22]) ).
fof(c_0_27,plain,
! [X35,X36,X37,X38,X39,X40,X41,X42] :
( X37 != X39
| ~ vtcheck(X36,X38,X35)
| ~ vtcheck(vbind(X37,X35,X36),vabs(X39,X40,X41),X42)
| vtcheck(X36,vsubst(X37,X38,vabs(X39,X40,X41)),X42) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['T-subst-abs-1'])]) ).
cnf(c_0_28,plain,
( vtcheck(vbind(X1,X2,X3),X4,X5)
| visFreeVar(X1,X4)
| ~ vtcheck(X3,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,negated_conjecture,
vtcheck(esk2_0,vabs(esk3_0,esk6_0,veabs),esk7_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_25]),c_0_26]) ).
cnf(c_0_30,plain,
( vtcheck(X1,vsubst(X2,X3,vabs(X4,X5,X6)),X7)
| ~ vtcheck(vbind(X2,X8,X1),vabs(X4,X5,X6),X7)
| ~ vtcheck(X1,X3,X8)
| X2 != X4 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( vtcheck(vbind(X1,X2,esk2_0),vabs(esk3_0,esk6_0,veabs),esk7_0)
| visFreeVar(X1,vabs(esk3_0,esk6_0,veabs)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( vtcheck(X1,vsubst(X2,X3,vabs(X2,X4,X5)),X6)
| ~ vtcheck(vbind(X2,X7,X1),vabs(X2,X4,X5),X6)
| ~ vtcheck(X1,X3,X7) ),
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_33,negated_conjecture,
vtcheck(vbind(esk3_0,X1,esk2_0),vabs(esk3_0,esk6_0,veabs),esk7_0),
inference(spm,[status(thm)],[c_0_26,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
( vtcheck(esk2_0,vsubst(esk3_0,X1,vabs(esk3_0,esk6_0,veabs)),esk7_0)
| ~ vtcheck(esk2_0,X1,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,negated_conjecture,
~ vtcheck(esk2_0,vsubst(esk3_0,esk4_0,vabs(esk3_0,esk6_0,veabs)),esk7_0),
inference(rw,[status(thm)],[c_0_19,c_0_25]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_21]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : COM133+1 : TPTP v8.1.0. Released v6.4.0.
% 0.08/0.15 % Command : run_ET %s %d
% 0.15/0.37 % Computer : n004.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 600
% 0.15/0.37 % DateTime : Thu Jun 16 19:09:23 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.29/1.47 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.29/1.47 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.29/1.47 # Preprocessing time : 0.024 s
% 0.29/1.47
% 0.29/1.47 # Proof found!
% 0.29/1.47 # SZS status Theorem
% 0.29/1.47 # SZS output start CNFRefutation
% See solution above
% 0.29/1.47 # Proof object total steps : 37
% 0.29/1.47 # Proof object clause steps : 22
% 0.29/1.47 # Proof object formula steps : 15
% 0.29/1.47 # Proof object conjectures : 15
% 0.29/1.47 # Proof object clause conjectures : 12
% 0.29/1.47 # Proof object formula conjectures : 3
% 0.29/1.47 # Proof object initial clauses used : 9
% 0.29/1.47 # Proof object initial formulas used : 7
% 0.29/1.47 # Proof object generating inferences : 8
% 0.29/1.47 # Proof object simplifying inferences : 11
% 0.29/1.47 # Training examples: 0 positive, 0 negative
% 0.29/1.47 # Parsed axioms : 62
% 0.29/1.47 # Removed by relevancy pruning/SinE : 38
% 0.29/1.47 # Initial clauses : 40
% 0.29/1.47 # Removed in clause preprocessing : 4
% 0.29/1.47 # Initial clauses in saturation : 36
% 0.29/1.47 # Processed clauses : 67
% 0.29/1.47 # ...of these trivial : 1
% 0.29/1.47 # ...subsumed : 2
% 0.29/1.47 # ...remaining for further processing : 64
% 0.29/1.47 # Other redundant clauses eliminated : 24
% 0.29/1.47 # Clauses deleted for lack of memory : 0
% 0.29/1.47 # Backward-subsumed : 1
% 0.29/1.47 # Backward-rewritten : 5
% 0.29/1.47 # Generated clauses : 62
% 0.29/1.47 # ...of the previous two non-trivial : 50
% 0.29/1.47 # Contextual simplify-reflections : 1
% 0.29/1.47 # Paramodulations : 29
% 0.29/1.47 # Factorizations : 0
% 0.29/1.47 # Equation resolutions : 42
% 0.29/1.47 # Current number of processed clauses : 43
% 0.29/1.47 # Positive orientable unit clauses : 6
% 0.29/1.47 # Positive unorientable unit clauses: 0
% 0.29/1.47 # Negative unit clauses : 5
% 0.29/1.47 # Non-unit-clauses : 32
% 0.29/1.47 # Current number of unprocessed clauses: 15
% 0.29/1.47 # ...number of literals in the above : 45
% 0.29/1.47 # Current number of archived formulas : 0
% 0.29/1.47 # Current number of archived clauses : 6
% 0.29/1.47 # Clause-clause subsumption calls (NU) : 228
% 0.29/1.47 # Rec. Clause-clause subsumption calls : 136
% 0.29/1.47 # Non-unit clause-clause subsumptions : 3
% 0.29/1.47 # Unit Clause-clause subsumption calls : 21
% 0.29/1.47 # Rewrite failures with RHS unbound : 0
% 0.29/1.47 # BW rewrite match attempts : 7
% 0.29/1.47 # BW rewrite match successes : 2
% 0.29/1.47 # Condensation attempts : 0
% 0.29/1.47 # Condensation successes : 0
% 0.29/1.47 # Termbank termtop insertions : 4834
% 0.29/1.47
% 0.29/1.47 # -------------------------------------------------
% 0.29/1.47 # User time : 0.023 s
% 0.29/1.47 # System time : 0.005 s
% 0.29/1.47 # Total time : 0.028 s
% 0.29/1.47 # Maximum resident set size: 3156 pages
%------------------------------------------------------------------------------