TSTP Solution File: ITP019+2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ITP019+2 : TPTP v8.1.2. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 : Sat May 4 08:09:01 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 10 ( 4 unt; 0 def)
% Number of atoms : 25 ( 16 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 28 ( 13 ~; 6 |; 3 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 5 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_thm_2Ecomplex_2ECOMPLEX__INV__NZ,conjecture,
! [X14] :
( mem(X14,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal))
=> ( X14 != ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0)
=> ap(c_2Ecomplex_2Ecomplex__inv,X14) != ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0) ) ),
file('/export/starexec/sandbox/tmp/tmp.LOhHMkcso8/E---3.1_28467.p',conj_thm_2Ecomplex_2ECOMPLEX__INV__NZ) ).
fof(conj_thm_2Ecomplex_2ECOMPLEX__INV__EQ__0,axiom,
! [X14] :
( mem(X14,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal))
=> ( ap(c_2Ecomplex_2Ecomplex__inv,X14) = ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0)
<=> X14 = ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0) ) ),
file('/export/starexec/sandbox/tmp/tmp.LOhHMkcso8/E---3.1_28467.p',conj_thm_2Ecomplex_2ECOMPLEX__INV__EQ__0) ).
fof(c_0_2,negated_conjecture,
~ ! [X14] :
( mem(X14,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal))
=> ( X14 != ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0)
=> ap(c_2Ecomplex_2Ecomplex__inv,X14) != ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_thm_2Ecomplex_2ECOMPLEX__INV__NZ])]) ).
fof(c_0_3,plain,
! [X25] :
( ( ap(c_2Ecomplex_2Ecomplex__inv,X25) != ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0)
| X25 = ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0)
| ~ mem(X25,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal)) )
& ( X25 != ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0)
| ap(c_2Ecomplex_2Ecomplex__inv,X25) = ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0)
| ~ mem(X25,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_thm_2Ecomplex_2ECOMPLEX__INV__EQ__0])])])]) ).
fof(c_0_4,negated_conjecture,
( mem(esk1_0,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal))
& esk1_0 != ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0)
& ap(c_2Ecomplex_2Ecomplex__inv,esk1_0) = ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
cnf(c_0_5,plain,
( X1 = ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0)
| ap(c_2Ecomplex_2Ecomplex__inv,X1) != ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0)
| ~ mem(X1,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
mem(esk1_0,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
ap(c_2Ecomplex_2Ecomplex__inv,esk1_0) = ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
esk1_0 != ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]),c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : ITP019+2 : TPTP v8.1.2. Bugfixed v7.5.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 12:24:48 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/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.LOhHMkcso8/E---3.1_28467.p
% 0.20/0.50 # Version: 3.1.0
% 0.20/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # new_bool_3 with pid 28545 completed with status 0
% 0.20/0.50 # Result found by new_bool_3
% 0.20/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGUSF-FFSM32-SFFFFFNN
% 0.20/0.50 # partial match(1): FGUPF-FFSM32-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.50 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 28550 completed with status 0
% 0.20/0.50 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGUSF-FFSM32-SFFFFFNN
% 0.20/0.50 # partial match(1): FGUPF-FFSM32-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 33
% 0.20/0.50 # Removed by relevancy pruning/SinE : 18
% 0.20/0.50 # Initial clauses : 34
% 0.20/0.50 # Removed in clause preprocessing : 15
% 0.20/0.50 # Initial clauses in saturation : 19
% 0.20/0.50 # Processed clauses : 35
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 35
% 0.20/0.50 # Other redundant clauses eliminated : 1
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 2
% 0.20/0.50 # ...of the previous two non-redundant : 1
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 1
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 1
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 1
% 0.20/0.50 # ...of those cached : 0
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 15
% 0.20/0.50 # Positive orientable unit clauses : 8
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 1
% 0.20/0.50 # Non-unit-clauses : 6
% 0.20/0.50 # Current number of unprocessed clauses: 4
% 0.20/0.50 # ...number of literals in the above : 16
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 19
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 2
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 2
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 0
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 0
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 2370
% 0.20/0.50 # Search garbage collected termcells : 619
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.006 s
% 0.20/0.50 # System time : 0.002 s
% 0.20/0.50 # Total time : 0.008 s
% 0.20/0.50 # Maximum resident set size: 1880 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.007 s
% 0.20/0.50 # System time : 0.005 s
% 0.20/0.50 # Total time : 0.012 s
% 0.20/0.50 # Maximum resident set size: 1728 pages
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------