TSTP Solution File: COM129+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : COM129+1 : TPTP v8.1.2. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:28 EDT 2023
% Result : Theorem 0.70s 0.55s
% Output : CNFRefutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 6 unt; 0 def)
% Number of atoms : 59 ( 23 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 69 ( 31 ~; 26 |; 5 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 55 ( 11 sgn; 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(isFreeVar2,axiom,
! [X1,X4,X12,X14,X13] :
( ( X1 = X14
& X4 = vapp(X12,X13) )
=> ( ( ( visFreeVar(X14,X12)
| visFreeVar(X14,X13) )
=> visFreeVar(X1,X4) )
& ( visFreeVar(X1,X4)
=> ( visFreeVar(X14,X12)
| visFreeVar(X14,X13) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.xKNba8M0kc/E---3.1_27872.p',isFreeVar2) ).
fof('fresh-free-2',conjecture,
! [X11,X9,X24,X12] :
( X24 = vgensym(vapp(vapp(X11,X12),vvar(X9)))
=> ~ visFreeVar(X24,X12) ),
file('/export/starexec/sandbox2/tmp/tmp.xKNba8M0kc/E---3.1_27872.p','fresh-free-2') ).
fof('gensym-is-fresh',axiom,
! [X14,X11] :
( vgensym(X11) = X14
=> ~ visFreeVar(X14,X11) ),
file('/export/starexec/sandbox2/tmp/tmp.xKNba8M0kc/E---3.1_27872.p','gensym-is-fresh') ).
fof(c_0_3,plain,
! [X50,X51,X52,X53,X54] :
( ( ~ visFreeVar(X53,X52)
| visFreeVar(X50,X51)
| X50 != X53
| X51 != vapp(X52,X54) )
& ( ~ visFreeVar(X53,X54)
| visFreeVar(X50,X51)
| X50 != X53
| X51 != vapp(X52,X54) )
& ( ~ visFreeVar(X50,X51)
| visFreeVar(X53,X52)
| visFreeVar(X53,X54)
| X50 != X53
| X51 != vapp(X52,X54) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[isFreeVar2])])]) ).
cnf(c_0_4,plain,
( visFreeVar(X3,X4)
| ~ visFreeVar(X1,X2)
| X3 != X1
| X4 != vapp(X5,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_5,negated_conjecture,
~ ! [X11,X9,X24,X12] :
( X24 = vgensym(vapp(vapp(X11,X12),vvar(X9)))
=> ~ visFreeVar(X24,X12) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['fresh-free-2'])]) ).
cnf(c_0_6,plain,
( visFreeVar(X3,X4)
| ~ visFreeVar(X1,X2)
| X3 != X1
| X4 != vapp(X2,X5) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
( visFreeVar(X1,X2)
| X2 != vapp(X3,X4)
| ~ visFreeVar(X1,X4) ),
inference(er,[status(thm)],[c_0_4]) ).
fof(c_0_8,negated_conjecture,
( esk3_0 = vgensym(vapp(vapp(esk1_0,esk4_0),vvar(esk2_0)))
& visFreeVar(esk3_0,esk4_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_9,plain,
! [X14,X11] :
( vgensym(X11) = X14
=> ~ visFreeVar(X14,X11) ),
inference(fof_simplification,[status(thm)],['gensym-is-fresh']) ).
cnf(c_0_10,plain,
( visFreeVar(X1,X2)
| X2 != vapp(X3,X4)
| ~ visFreeVar(X1,X3) ),
inference(er,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( visFreeVar(X1,vapp(X2,X3))
| ~ visFreeVar(X1,X3) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
visFreeVar(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X82,X83] :
( vgensym(X83) != X82
| ~ visFreeVar(X82,X83) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])]) ).
cnf(c_0_14,plain,
( visFreeVar(X1,vapp(X2,X3))
| ~ visFreeVar(X1,X2) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
visFreeVar(esk3_0,vapp(X1,esk4_0)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( vgensym(X1) != X2
| ~ visFreeVar(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
visFreeVar(esk3_0,vapp(vapp(X1,esk4_0),X2)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
esk3_0 = vgensym(vapp(vapp(esk1_0,esk4_0),vvar(esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,negated_conjecture,
vgensym(vapp(vapp(X1,esk4_0),X2)) != esk3_0,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_18,c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COM129+1 : TPTP v8.1.2. Released v6.4.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 05:14:22 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.48 Running first-order model finding
% 0.19/0.48 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.xKNba8M0kc/E---3.1_27872.p
% 0.70/0.55 # Version: 3.1pre001
% 0.70/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.70/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.70/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.70/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.70/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.70/0.55 # Starting sh5l with 300s (1) cores
% 0.70/0.55 # new_bool_3 with pid 27950 completed with status 0
% 0.70/0.55 # Result found by new_bool_3
% 0.70/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.70/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.70/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.70/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.70/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.70/0.55 # Search class: FGHSF-FSLF33-MFFFFFNN
% 0.70/0.55 # partial match(1): FGHSF-FSLF32-MFFFFFNN
% 0.70/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.70/0.55 # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 181s (1) cores
% 0.70/0.55 # G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with pid 27953 completed with status 0
% 0.70/0.55 # Result found by G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN
% 0.70/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.70/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.70/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.70/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.70/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.70/0.55 # Search class: FGHSF-FSLF33-MFFFFFNN
% 0.70/0.55 # partial match(1): FGHSF-FSLF32-MFFFFFNN
% 0.70/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.70/0.55 # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 181s (1) cores
% 0.70/0.55 # Preprocessing time : 0.005 s
% 0.70/0.55 # Presaturation interreduction done
% 0.70/0.55
% 0.70/0.55 # Proof found!
% 0.70/0.55 # SZS status Theorem
% 0.70/0.55 # SZS output start CNFRefutation
% See solution above
% 0.70/0.55 # Parsed axioms : 66
% 0.70/0.55 # Removed by relevancy pruning/SinE : 41
% 0.70/0.55 # Initial clauses : 210
% 0.70/0.55 # Removed in clause preprocessing : 4
% 0.70/0.55 # Initial clauses in saturation : 206
% 0.70/0.55 # Processed clauses : 453
% 0.70/0.55 # ...of these trivial : 0
% 0.70/0.55 # ...subsumed : 1
% 0.70/0.55 # ...remaining for further processing : 452
% 0.70/0.55 # Other redundant clauses eliminated : 26
% 0.70/0.55 # Clauses deleted for lack of memory : 0
% 0.70/0.55 # Backward-subsumed : 1
% 0.70/0.55 # Backward-rewritten : 0
% 0.70/0.55 # Generated clauses : 86
% 0.70/0.55 # ...of the previous two non-redundant : 68
% 0.70/0.55 # ...aggressively subsumed : 0
% 0.70/0.55 # Contextual simplify-reflections : 0
% 0.70/0.55 # Paramodulations : 40
% 0.70/0.55 # Factorizations : 0
% 0.70/0.55 # NegExts : 0
% 0.70/0.55 # Equation resolutions : 55
% 0.70/0.55 # Total rewrite steps : 8
% 0.70/0.55 # Propositional unsat checks : 0
% 0.70/0.55 # Propositional check models : 0
% 0.70/0.55 # Propositional check unsatisfiable : 0
% 0.70/0.55 # Propositional clauses : 0
% 0.70/0.55 # Propositional clauses after purity: 0
% 0.70/0.55 # Propositional unsat core size : 0
% 0.70/0.55 # Propositional preprocessing time : 0.000
% 0.70/0.55 # Propositional encoding time : 0.000
% 0.70/0.55 # Propositional solver time : 0.000
% 0.70/0.55 # Success case prop preproc time : 0.000
% 0.70/0.55 # Success case prop encoding time : 0.000
% 0.70/0.55 # Success case prop solver time : 0.000
% 0.70/0.55 # Current number of processed clauses : 228
% 0.70/0.55 # Positive orientable unit clauses : 10
% 0.70/0.55 # Positive unorientable unit clauses: 0
% 0.70/0.55 # Negative unit clauses : 13
% 0.70/0.55 # Non-unit-clauses : 205
% 0.70/0.55 # Current number of unprocessed clauses: 27
% 0.70/0.55 # ...number of literals in the above : 46
% 0.70/0.55 # Current number of archived formulas : 0
% 0.70/0.55 # Current number of archived clauses : 208
% 0.70/0.55 # Clause-clause subsumption calls (NU) : 18756
% 0.70/0.55 # Rec. Clause-clause subsumption calls : 466
% 0.70/0.55 # Non-unit clause-clause subsumptions : 0
% 0.70/0.55 # Unit Clause-clause subsumption calls : 498
% 0.70/0.55 # Rewrite failures with RHS unbound : 0
% 0.70/0.55 # BW rewrite match attempts : 2
% 0.70/0.55 # BW rewrite match successes : 0
% 0.70/0.55 # Condensation attempts : 0
% 0.70/0.55 # Condensation successes : 0
% 0.70/0.55 # Termbank termtop insertions : 18781
% 0.70/0.55
% 0.70/0.55 # -------------------------------------------------
% 0.70/0.55 # User time : 0.048 s
% 0.70/0.55 # System time : 0.004 s
% 0.70/0.55 # Total time : 0.052 s
% 0.70/0.55 # Maximum resident set size: 2376 pages
% 0.70/0.55
% 0.70/0.55 # -------------------------------------------------
% 0.70/0.55 # User time : 0.051 s
% 0.70/0.55 # System time : 0.006 s
% 0.70/0.55 # Total time : 0.058 s
% 0.70/0.55 # Maximum resident set size: 1812 pages
% 0.70/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------