TSTP Solution File: SYO543^1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SYO543^1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 20:34:14 EDT 2024
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 37 ( 23 equ; 0 cnn)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 65 ( 15 ~; 12 |; 18 &; 19 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 23 ( 23 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 2 con; 0-4 aty)
% Number of variables : 24 ( 13 ^ 10 !; 1 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
epsii: ( ( $i > $i ) > $o ) > $i > $i ).
thf(decl_23,type,
if: $o > ( $i > $i ) > ( $i > $i ) > $i > $i ).
thf(decl_24,type,
epred1_0: $o ).
thf(decl_25,type,
esk1_0: $i > $i ).
thf(ifd,axiom,
( if
= ( ^ [X3: $o,X2: $i > $i,X4: $i > $i] :
( epsii
@ ^ [X5: $i > $i] :
( ( X3
& ( X5 = X2 ) )
| ( ~ X3
& ( X5 = X4 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Gm98GBcva3/E---3.1_31102.p',ifd) ).
thf(conj,conjecture,
! [X3: $o,X2: $i > $i] :
( ( if @ X3 @ X2 @ X2 )
= X2 ),
file('/export/starexec/sandbox2/tmp/tmp.Gm98GBcva3/E---3.1_31102.p',conj) ).
thf(choiceaxii,axiom,
! [X1: ( $i > $i ) > $o] :
( ? [X2: $i > $i] : ( X1 @ X2 )
=> ( X1 @ ( epsii @ X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Gm98GBcva3/E---3.1_31102.p',choiceaxii) ).
thf(c_0_3,plain,
( if
= ( ^ [Z0: $o,Z1: $i > $i,Z2: $i > $i] :
( epsii
@ ^ [Z3: $i > $i] :
( ( Z0
& ( Z3 = Z1 ) )
| ( ~ Z0
& Z3 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ifd]) ).
thf(c_0_4,negated_conjecture,
~ ! [X3: $o,X2: $i > $i] :
( ( epsii
@ ^ [Z0: $i > $i] :
( ( X3
& ( Z0 = X2 ) )
| ( ~ X3
& ( Z0 = X2 ) ) ) )
= X2 ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]),c_0_3]) ).
thf(c_0_5,negated_conjecture,
( ( epsii
@ ^ [Z0: $i > $i] :
( ( epred1_0
& ( Z0 = esk1_0 ) )
| ( ~ epred1_0
& ( Z0 = esk1_0 ) ) ) )
!= esk1_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
thf(c_0_6,plain,
! [X12: ( $i > $i ) > $o,X13: $i > $i] :
( ~ ( X12 @ X13 )
| ( X12 @ ( epsii @ X12 ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[choiceaxii])])])]) ).
thf(c_0_7,negated_conjecture,
( ( epsii
@ ^ [Z0: $i > $i] :
( ( epred1_0
& ( Z0 = esk1_0 ) )
| ( ~ epred1_0
& ( Z0 = esk1_0 ) ) ) )
!= esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
! [X1: ( $i > $i ) > $o,X2: $i > $i] :
( ( X1 @ ( epsii @ X1 ) )
| ~ ( X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X2: $i > $i] :
( ( epred1_0
& ( ( epsii
@ ^ [Z0: $i > $i] :
( ( epred1_0
& ( Z0 = esk1_0 ) )
| ( ~ epred1_0
& ( Z0 = esk1_0 ) ) ) )
= esk1_0 ) )
| ( ~ epred1_0
& ( ( epsii
@ ^ [Z0: $i > $i] :
( ( epred1_0
& ( Z0 = esk1_0 ) )
| ( ~ epred1_0
& ( Z0 = esk1_0 ) ) ) )
= esk1_0 ) )
| ~ ( ( epred1_0
& ( X2 = esk1_0 ) )
| ( ~ epred1_0
& ( X2 = esk1_0 ) ) ) ),
inference(choice_inst,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_10,negated_conjecture,
epred1_0,
inference(er,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_9])]),c_0_7])]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_9])]),c_0_7])]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYO543^1 : TPTP v8.2.0. Released v5.2.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n024.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun Jun 23 06:55:54 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.19/0.47 Running higher-order theorem proving
% 0.19/0.47 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.Gm98GBcva3/E---3.1_31102.p
% 0.19/0.49 # Version: 3.2.0-ho
% 0.19/0.49 # Preprocessing class: HSSSSMSSSSSCHSA.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_2 with 300s (1) cores
% 0.19/0.49 # sh5l with pid 31218 completed with status 0
% 0.19/0.49 # Result found by sh5l
% 0.19/0.49 # Preprocessing class: HSSSSMSSSSSCHSA.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.49 # Search class: HHUSF-FFSF22-MHSFFMBC
% 0.19/0.49 # partial match(3): HHUSS-FFSF21-MHHFFMBC
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting new_ho_10 with 181s (1) cores
% 0.19/0.49 # new_ho_10 with pid 31223 completed with status 9
% 0.19/0.49 # Starting sh5l with 31s (1) cores
% 0.19/0.49 # sh5l with pid 31231 completed with status 0
% 0.19/0.49 # Result found by sh5l
% 0.19/0.49 # Preprocessing class: HSSSSMSSSSSCHSA.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.49 # Search class: HHUSF-FFSF22-MHSFFMBC
% 0.19/0.49 # partial match(3): HHUSS-FFSF21-MHHFFMBC
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting new_ho_10 with 181s (1) cores
% 0.19/0.49 # new_ho_10 with pid 31223 completed with status 9
% 0.19/0.49 # Starting sh5l with 31s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Theorem
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 5
% 0.19/0.49 # Removed by relevancy pruning/SinE : 2
% 0.19/0.49 # Initial clauses : 2
% 0.19/0.49 # Removed in clause preprocessing : 0
% 0.19/0.49 # Initial clauses in saturation : 2
% 0.19/0.49 # Processed clauses : 8
% 0.19/0.49 # ...of these trivial : 0
% 0.19/0.49 # ...subsumed : 0
% 0.19/0.49 # ...remaining for further processing : 7
% 0.19/0.49 # Other redundant clauses eliminated : 4
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 0
% 0.19/0.49 # Backward-rewritten : 0
% 0.19/0.49 # Generated clauses : 16
% 0.19/0.49 # ...of the previous two non-redundant : 8
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 0
% 0.19/0.49 # Paramodulations : 0
% 0.19/0.49 # Factorizations : 0
% 0.19/0.49 # NegExts : 1
% 0.19/0.49 # Equation resolutions : 4
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 1
% 0.19/0.49 # ...of those cached : 0
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 4
% 0.19/0.49 # Positive orientable unit clauses : 1
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 2
% 0.19/0.49 # Non-unit-clauses : 1
% 0.19/0.49 # Current number of unprocessed clauses: 4
% 0.19/0.49 # ...number of literals in the above : 5
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 3
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 1
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 1
% 0.19/0.49 # Non-unit clause-clause subsumptions : 0
% 0.19/0.49 # Unit Clause-clause subsumption calls : 0
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 0
% 0.19/0.49 # BW rewrite match successes : 0
% 0.19/0.49 # Condensation attempts : 8
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 2042
% 0.19/0.49 # Search garbage collected termcells : 69
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.006 s
% 0.19/0.49 # System time : 0.002 s
% 0.19/0.49 # Total time : 0.008 s
% 0.19/0.49 # Maximum resident set size: 1784 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.006 s
% 0.19/0.49 # System time : 0.005 s
% 0.19/0.49 # Total time : 0.011 s
% 0.19/0.49 # Maximum resident set size: 1728 pages
% 0.19/0.49 % E---3.1 exiting
% 0.19/0.49 % E exiting
%------------------------------------------------------------------------------