TSTP Solution File: COM125+1 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : COM125+1 : TPTP v8.2.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% Computer : n032.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 : Mon Jun 24 04:55:04 EDT 2024
% Result : Theorem 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 4 unt; 0 def)
% Number of atoms : 50 ( 8 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 53 ( 20 ~; 15 |; 12 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-3 aty)
% Number of variables : 68 ( 4 sgn 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('T-Weak-FreeVar-abs-2',axiom,
! [X9,X10,X20,X21,X35,X15] :
( ( X9 = X21
& ~ visFreeVar(X9,vabs(X21,X35,veabs))
& vtcheck(X20,vabs(X21,X35,veabs),X15) )
=> vtcheck(vbind(X9,X10,X20),vabs(X21,X35,veabs),X15) ),
file('/export/starexec/sandbox2/tmp/tmp.b1lCDsWA7Z/E---3.1_13066.p','T-Weak-FreeVar-abs-2') ).
fof('T-Weak-FreeVar-abs-1',axiom,
! [X9,X10,X20,X21,X35,X15] :
( ( X9 != X21
& ~ visFreeVar(X9,vabs(X21,X35,veabs))
& vtcheck(X20,vabs(X21,X35,veabs),X15) )
=> vtcheck(vbind(X9,X10,X20),vabs(X21,X35,veabs),X15) ),
file('/export/starexec/sandbox2/tmp/tmp.b1lCDsWA7Z/E---3.1_13066.p','T-Weak-FreeVar-abs-1') ).
fof('T-Weak-FreeVar-abs',conjecture,
! [X9,X10,X20,X21,X35,X15] :
( ( ~ visFreeVar(X9,vabs(X21,X35,veabs))
& vtcheck(X20,vabs(X21,X35,veabs),X15) )
=> vtcheck(vbind(X9,X10,X20),vabs(X21,X35,veabs),X15) ),
file('/export/starexec/sandbox2/tmp/tmp.b1lCDsWA7Z/E---3.1_13066.p','T-Weak-FreeVar-abs') ).
fof(c_0_3,plain,
! [X9,X10,X20,X21,X35,X15] :
( ( X9 = X21
& ~ visFreeVar(X9,vabs(X21,X35,veabs))
& vtcheck(X20,vabs(X21,X35,veabs),X15) )
=> vtcheck(vbind(X9,X10,X20),vabs(X21,X35,veabs),X15) ),
inference(fof_simplification,[status(thm)],['T-Weak-FreeVar-abs-2']) ).
fof(c_0_4,plain,
! [X9,X10,X20,X21,X35,X15] :
( ( X9 != X21
& ~ visFreeVar(X9,vabs(X21,X35,veabs))
& vtcheck(X20,vabs(X21,X35,veabs),X15) )
=> vtcheck(vbind(X9,X10,X20),vabs(X21,X35,veabs),X15) ),
inference(fof_simplification,[status(thm)],['T-Weak-FreeVar-abs-1']) ).
fof(c_0_5,plain,
! [X82,X83,X84,X85,X86,X87] :
( X82 != X85
| visFreeVar(X82,vabs(X85,X86,veabs))
| ~ vtcheck(X84,vabs(X85,X86,veabs),X87)
| vtcheck(vbind(X82,X83,X84),vabs(X85,X86,veabs),X87) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_6,plain,
! [X76,X77,X78,X79,X80,X81] :
( X76 = X79
| visFreeVar(X76,vabs(X79,X80,veabs))
| ~ vtcheck(X78,vabs(X79,X80,veabs),X81)
| vtcheck(vbind(X76,X77,X78),vabs(X79,X80,veabs),X81) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,negated_conjecture,
~ ! [X9,X10,X20,X21,X35,X15] :
( ( ~ visFreeVar(X9,vabs(X21,X35,veabs))
& vtcheck(X20,vabs(X21,X35,veabs),X15) )
=> vtcheck(vbind(X9,X10,X20),vabs(X21,X35,veabs),X15) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['T-Weak-FreeVar-abs'])]) ).
cnf(c_0_8,plain,
( visFreeVar(X1,vabs(X2,X3,veabs))
| vtcheck(vbind(X1,X6,X4),vabs(X2,X3,veabs),X5)
| X1 != X2
| ~ vtcheck(X4,vabs(X2,X3,veabs),X5) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( X1 = X2
| visFreeVar(X1,vabs(X2,X3,veabs))
| vtcheck(vbind(X1,X6,X4),vabs(X2,X3,veabs),X5)
| ~ vtcheck(X4,vabs(X2,X3,veabs),X5) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,negated_conjecture,
( ~ visFreeVar(esk1_0,vabs(esk4_0,esk5_0,veabs))
& vtcheck(esk3_0,vabs(esk4_0,esk5_0,veabs),esk6_0)
& ~ vtcheck(vbind(esk1_0,esk2_0,esk3_0),vabs(esk4_0,esk5_0,veabs),esk6_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_11,plain,
( vtcheck(vbind(X1,X2,X3),vabs(X4,X5,veabs),X6)
| visFreeVar(X1,vabs(X4,X5,veabs))
| ~ vtcheck(X3,vabs(X4,X5,veabs),X6) ),
inference(csr,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
vtcheck(esk3_0,vabs(esk4_0,esk5_0,veabs),esk6_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
~ vtcheck(vbind(esk1_0,esk2_0,esk3_0),vabs(esk4_0,esk5_0,veabs),esk6_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( vtcheck(vbind(X1,X2,esk3_0),vabs(esk4_0,esk5_0,veabs),esk6_0)
| visFreeVar(X1,vabs(esk4_0,esk5_0,veabs)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
~ visFreeVar(esk1_0,vabs(esk4_0,esk5_0,veabs)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : COM125+1 : TPTP v8.2.0. Released v6.4.0.
% 0.00/0.09 % Command : run_E %s %d SAT
% 0.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Thu Jun 20 23:41:08 EDT 2024
% 0.08/0.28 % CPUTime :
% 0.14/0.38 Running first-order model finding
% 0.14/0.38 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/tmp/tmp.b1lCDsWA7Z/E---3.1_13066.p
% 0.14/0.41 # Version: 3.2.0
% 0.14/0.41 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # Starting sh5l with 300s (1) cores
% 0.14/0.41 # new_bool_3 with pid 13147 completed with status 0
% 0.14/0.41 # Result found by new_bool_3
% 0.14/0.41 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 # Search class: FGHSF-FSLF32-MFFFFFNN
% 0.14/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 181s (1) cores
% 0.14/0.41 # G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with pid 13150 completed with status 0
% 0.14/0.41 # Result found by G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN
% 0.14/0.41 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 # Search class: FGHSF-FSLF32-MFFFFFNN
% 0.14/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 181s (1) cores
% 0.14/0.41 # Preprocessing time : 0.002 s
% 0.14/0.41 # Presaturation interreduction done
% 0.14/0.41
% 0.14/0.41 # Proof found!
% 0.14/0.41 # SZS status Theorem
% 0.14/0.41 # SZS output start CNFRefutation
% See solution above
% 0.14/0.41 # Parsed axioms : 60
% 0.14/0.41 # Removed by relevancy pruning/SinE : 25
% 0.14/0.41 # Initial clauses : 161
% 0.14/0.41 # Removed in clause preprocessing : 5
% 0.14/0.41 # Initial clauses in saturation : 156
% 0.14/0.41 # Processed clauses : 320
% 0.14/0.41 # ...of these trivial : 2
% 0.14/0.41 # ...subsumed : 45
% 0.14/0.41 # ...remaining for further processing : 273
% 0.14/0.41 # Other redundant clauses eliminated : 23
% 0.14/0.41 # Clauses deleted for lack of memory : 0
% 0.14/0.41 # Backward-subsumed : 1
% 0.14/0.41 # Backward-rewritten : 0
% 0.14/0.41 # Generated clauses : 209
% 0.14/0.41 # ...of the previous two non-redundant : 183
% 0.14/0.41 # ...aggressively subsumed : 0
% 0.14/0.41 # Contextual simplify-reflections : 1
% 0.14/0.41 # Paramodulations : 154
% 0.14/0.41 # Factorizations : 0
% 0.14/0.41 # NegExts : 0
% 0.14/0.41 # Equation resolutions : 64
% 0.14/0.41 # Disequality decompositions : 0
% 0.14/0.41 # Total rewrite steps : 7
% 0.14/0.41 # ...of those cached : 1
% 0.14/0.41 # Propositional unsat checks : 0
% 0.14/0.41 # Propositional check models : 0
% 0.14/0.41 # Propositional check unsatisfiable : 0
% 0.14/0.41 # Propositional clauses : 0
% 0.14/0.41 # Propositional clauses after purity: 0
% 0.14/0.41 # Propositional unsat core size : 0
% 0.14/0.41 # Propositional preprocessing time : 0.000
% 0.14/0.41 # Propositional encoding time : 0.000
% 0.14/0.41 # Propositional solver time : 0.000
% 0.14/0.41 # Success case prop preproc time : 0.000
% 0.14/0.41 # Success case prop encoding time : 0.000
% 0.14/0.41 # Success case prop solver time : 0.000
% 0.14/0.41 # Current number of processed clauses : 143
% 0.14/0.41 # Positive orientable unit clauses : 13
% 0.14/0.41 # Positive unorientable unit clauses: 0
% 0.14/0.41 # Negative unit clauses : 10
% 0.14/0.41 # Non-unit-clauses : 120
% 0.14/0.41 # Current number of unprocessed clauses: 133
% 0.14/0.41 # ...number of literals in the above : 353
% 0.14/0.41 # Current number of archived formulas : 0
% 0.14/0.41 # Current number of archived clauses : 116
% 0.14/0.41 # Clause-clause subsumption calls (NU) : 6885
% 0.14/0.41 # Rec. Clause-clause subsumption calls : 2506
% 0.14/0.41 # Non-unit clause-clause subsumptions : 44
% 0.14/0.41 # Unit Clause-clause subsumption calls : 287
% 0.14/0.41 # Rewrite failures with RHS unbound : 0
% 0.14/0.41 # BW rewrite match attempts : 0
% 0.14/0.41 # BW rewrite match successes : 0
% 0.14/0.41 # Condensation attempts : 0
% 0.14/0.41 # Condensation successes : 0
% 0.14/0.41 # Termbank termtop insertions : 17899
% 0.14/0.41 # Search garbage collected termcells : 2283
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.020 s
% 0.14/0.41 # System time : 0.003 s
% 0.14/0.41 # Total time : 0.023 s
% 0.14/0.41 # Maximum resident set size: 2296 pages
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.022 s
% 0.14/0.41 # System time : 0.005 s
% 0.14/0.41 # Total time : 0.027 s
% 0.14/0.41 # Maximum resident set size: 1808 pages
% 0.14/0.41 % E---3.1 exiting
% 0.14/0.41 % E exiting
%------------------------------------------------------------------------------