TSTP Solution File: NUM753^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM753^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:57:42 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of formulae : 33 ( 12 unt; 8 typ; 0 def)
% Number of atoms : 56 ( 0 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 225 ( 28 ~; 25 |; 0 &; 166 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 8 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 57 ( 0 ^ 57 !; 0 ?; 57 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
frac: $tType ).
thf(decl_22,type,
x: frac ).
thf(decl_23,type,
y: frac ).
thf(decl_24,type,
z: frac ).
thf(decl_25,type,
u: frac ).
thf(decl_26,type,
eq: frac > frac > $o ).
thf(decl_27,type,
moref: frac > frac > $o ).
thf(decl_28,type,
pf: frac > frac > frac ).
thf(satz44,axiom,
! [X1: frac,X2: frac,X3: frac,X4: frac] :
( ( moref @ X1 @ X2 )
=> ( ( eq @ X1 @ X3 )
=> ( ( eq @ X2 @ X4 )
=> ( moref @ X3 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ShvtgRvti5/E---3.1_18073.p',satz44) ).
thf(satz56,axiom,
! [X1: frac,X2: frac,X3: frac,X4: frac] :
( ( eq @ X1 @ X2 )
=> ( ( eq @ X3 @ X4 )
=> ( eq @ ( pf @ X1 @ X3 ) @ ( pf @ X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ShvtgRvti5/E---3.1_18073.p',satz56) ).
thf(satz62d,axiom,
! [X1: frac,X2: frac,X3: frac] :
( ( moref @ X1 @ X2 )
=> ( moref @ ( pf @ X3 @ X1 ) @ ( pf @ X3 @ X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ShvtgRvti5/E---3.1_18073.p',satz62d) ).
thf(satz37,axiom,
! [X1: frac] : ( eq @ X1 @ X1 ),
file('/export/starexec/sandbox2/tmp/tmp.ShvtgRvti5/E---3.1_18073.p',satz37) ).
thf(satz62g,conjecture,
moref @ ( pf @ x @ z ) @ ( pf @ y @ u ),
file('/export/starexec/sandbox2/tmp/tmp.ShvtgRvti5/E---3.1_18073.p',satz62g) ).
thf(e,axiom,
eq @ x @ y,
file('/export/starexec/sandbox2/tmp/tmp.ShvtgRvti5/E---3.1_18073.p',e) ).
thf(m,axiom,
moref @ z @ u,
file('/export/starexec/sandbox2/tmp/tmp.ShvtgRvti5/E---3.1_18073.p',m) ).
thf(c_0_7,plain,
! [X17: frac,X18: frac,X19: frac,X20: frac] :
( ~ ( moref @ X17 @ X18 )
| ~ ( eq @ X17 @ X19 )
| ~ ( eq @ X18 @ X20 )
| ( moref @ X19 @ X20 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz44])])]) ).
thf(c_0_8,plain,
! [X24: frac,X25: frac,X26: frac,X27: frac] :
( ~ ( eq @ X24 @ X25 )
| ~ ( eq @ X26 @ X27 )
| ( eq @ ( pf @ X24 @ X26 ) @ ( pf @ X25 @ X27 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz56])])]) ).
thf(c_0_9,plain,
! [X1: frac,X2: frac,X3: frac,X4: frac] :
( ( moref @ X3 @ X4 )
| ~ ( moref @ X1 @ X2 )
| ~ ( eq @ X1 @ X3 )
| ~ ( eq @ X2 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,plain,
! [X1: frac,X2: frac,X3: frac,X4: frac] :
( ( eq @ ( pf @ X1 @ X3 ) @ ( pf @ X2 @ X4 ) )
| ~ ( eq @ X1 @ X2 )
| ~ ( eq @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_11,plain,
! [X21: frac,X22: frac,X23: frac] :
( ~ ( moref @ X21 @ X22 )
| ( moref @ ( pf @ X23 @ X21 ) @ ( pf @ X23 @ X22 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz62d])])]) ).
thf(c_0_12,plain,
! [X1: frac,X4: frac,X6: frac,X5: frac,X3: frac,X2: frac] :
( ( moref @ X1 @ ( pf @ X2 @ X3 ) )
| ~ ( moref @ X4 @ ( pf @ X5 @ X6 ) )
| ~ ( eq @ X4 @ X1 )
| ~ ( eq @ X6 @ X3 )
| ~ ( eq @ X5 @ X2 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_13,plain,
! [X1: frac,X3: frac,X2: frac] :
( ( moref @ ( pf @ X3 @ X1 ) @ ( pf @ X3 @ X2 ) )
| ~ ( moref @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_14,plain,
! [X28: frac] : ( eq @ X28 @ X28 ),
inference(variable_rename,[status(thm)],[satz37]) ).
thf(c_0_15,negated_conjecture,
~ ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz62g])]) ).
thf(c_0_16,plain,
! [X1: frac,X2: frac,X4: frac,X3: frac,X5: frac,X6: frac] :
( ( moref @ X1 @ ( pf @ X2 @ X3 ) )
| ~ ( eq @ ( pf @ X4 @ X5 ) @ X1 )
| ~ ( eq @ X6 @ X3 )
| ~ ( eq @ X4 @ X2 )
| ~ ( moref @ X5 @ X6 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_17,plain,
! [X1: frac] : ( eq @ X1 @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_18,negated_conjecture,
~ ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) ),
inference(fof_nnf,[status(thm)],[c_0_15]) ).
thf(c_0_19,plain,
! [X1: frac,X2: frac,X4: frac,X3: frac,X5: frac] :
( ( moref @ ( pf @ X1 @ X2 ) @ ( pf @ X3 @ X4 ) )
| ~ ( eq @ X5 @ X4 )
| ~ ( eq @ X1 @ X3 )
| ~ ( moref @ X2 @ X5 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_20,negated_conjecture,
~ ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_21,plain,
! [X1: frac,X2: frac,X3: frac,X4: frac] :
( ( moref @ ( pf @ X1 @ X2 ) @ ( pf @ X3 @ X4 ) )
| ~ ( eq @ X1 @ X3 )
| ~ ( moref @ X2 @ X4 ) ),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
thf(c_0_22,plain,
eq @ x @ y,
inference(split_conjunct,[status(thm)],[e]) ).
thf(c_0_23,plain,
moref @ z @ u,
inference(split_conjunct,[status(thm)],[m]) ).
thf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM753^1 : TPTP v8.1.2. Released v3.7.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.12/0.35 % Computer : n021.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Fri May 3 09:17:58 EDT 2024
% 0.12/0.36 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.ShvtgRvti5/E---3.1_18073.p
% 0.20/0.49 # Version: 3.1.0-ho
% 0.20/0.49 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting full_lambda_5 with 300s (1) cores
% 0.20/0.49 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.49 # new_bool_1 with pid 18152 completed with status 0
% 0.20/0.49 # Result found by new_bool_1
% 0.20/0.49 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: HHUNF-FFSF22-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.49 # new_ho_10 with pid 18159 completed with status 0
% 0.20/0.49 # Result found by new_ho_10
% 0.20/0.49 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: HHUNF-FFSF22-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 15
% 0.20/0.49 # Removed by relevancy pruning/SinE : 8
% 0.20/0.49 # Initial clauses : 7
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 7
% 0.20/0.49 # Processed clauses : 29
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 29
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 31
% 0.20/0.49 # ...of the previous two non-redundant : 29
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 31
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 3
% 0.20/0.49 # ...of those cached : 1
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 22
% 0.20/0.49 # Positive orientable unit clauses : 3
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 1
% 0.20/0.49 # Non-unit-clauses : 18
% 0.20/0.49 # Current number of unprocessed clauses: 12
% 0.20/0.49 # ...number of literals in the above : 61
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 7
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 149
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 104
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 0.20/0.49 # Unit Clause-clause subsumption calls : 0
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 2
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 29
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 1453
% 0.20/0.49 # Search garbage collected termcells : 112
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.003 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.006 s
% 0.20/0.49 # Maximum resident set size: 1760 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.003 s
% 0.20/0.49 # System time : 0.005 s
% 0.20/0.49 # Total time : 0.008 s
% 0.20/0.49 # Maximum resident set size: 1720 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------