TSTP Solution File: SYO542^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO542^1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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 : Tue May 21 08:48:00 EDT 2024
% Result : Theorem 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 33 ( 9 unt; 6 typ; 0 def)
% Number of atoms : 90 ( 39 equ; 0 cnn)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 241 ( 43 ~; 34 |; 20 &; 142 @)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 73 ( 73 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 3 con; 0-4 aty)
% Number of variables : 59 ( 6 ^ 52 !; 1 ?; 59 :)
% 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(decl_26,type,
esk2_0: $i > $i ).
thf(decl_27,type,
epred2_3: ( $i > $i ) > $o > ( $i > $i ) > ( $i > $i ) > $o ).
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/benchmark/theBenchmark.p',ifd) ).
thf(choiceaxii,axiom,
! [X1: ( $i > $i ) > $o] :
( ? [X2: $i > $i] : ( X1 @ X2 )
=> ( X1 @ ( epsii @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',choiceaxii) ).
thf(conj,conjecture,
! [X3: $o,X2: $i > $i,X4: $i > $i] :
( ( ( if @ X3 @ X2 @ X4 )
= X2 )
| ( ( if @ X3 @ X2 @ X4 )
= X4 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(c_0_3,plain,
! [X23: $i > $i,X24: $i > $i,X25: $o,X26: $i > $i] :
( ( ~ X25
| X25
| ~ ( epred2_3 @ X26 @ X25 @ X24 @ X23 ) )
& ( ( X23 = X26 )
| X25
| ~ ( epred2_3 @ X26 @ X25 @ X24 @ X23 ) )
& ( ~ X25
| ( X23 = X24 )
| ~ ( epred2_3 @ X26 @ X25 @ X24 @ X23 ) )
& ( ( X23 = X26 )
| ( X23 = X24 )
| ~ ( epred2_3 @ X26 @ X25 @ X24 @ X23 ) )
& ( ~ X25
| ( X23 != X24 )
| ( epred2_3 @ X26 @ X25 @ X24 @ X23 ) )
& ( X25
| ( X23 != X26 )
| ( epred2_3 @ X26 @ X25 @ X24 @ X23 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[])])])])]) ).
thf(c_0_4,plain,
! [X11: $o,X12: $i > $i,X13: $i > $i] :
( ( if @ X11 @ X12 @ X13 )
= ( epsii
@ ^ [Z0: $i > $i] :
( ( X11
& ( Z0 = X12 ) )
| ( ~ X11
& ( Z0 = X13 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[ifd])]) ).
thf(c_0_5,plain,
! [X14: ( $i > $i ) > $o,X15: $i > $i] :
( ~ ( X14 @ X15 )
| ( X14 @ ( epsii @ X14 ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[choiceaxii])])])]) ).
thf(c_0_6,plain,
! [X2: $i > $i,X5: $i > $i,X4: $i > $i] :
( ( epred2_3 @ X4 @ ~ $true @ X5 @ X2 )
| ( X2 != X4 ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3])])]) ).
thf(c_0_7,plain,
! [X16: $o,X17: $i > $i,X18: $i > $i] :
( ( if @ X16 @ X17 @ X18 )
= ( epsii
@ ^ [Z0: $i > $i] :
( ( X16
& ( Z0 = X17 ) )
| ( ~ X16
& ( Z0 = X18 ) ) ) ) ),
inference(variable_rename,[status(thm)],[c_0_4]) ).
thf(c_0_8,plain,
! [X22: $i > $i,X2: $i > $i,X3: $o,X4: $i > $i] :
( ( epred2_3 @ X4 @ X3 @ X2 @ X22 )
<=> ( ( X3
& ( X22 = X2 ) )
| ( ~ X3
& ( X22 = X4 ) ) ) ),
introduced(definition) ).
thf(c_0_9,negated_conjecture,
~ ! [X3: $o,X2: $i > $i,X4: $i > $i] :
( ( ( if @ X3 @ X2 @ X4 )
= X2 )
| ( ( if @ X3 @ X2 @ X4 )
= X4 ) ),
inference(assume_negation,[status(cth)],[conj]) ).
thf(c_0_10,plain,
! [X1: ( $i > $i ) > $o,X2: $i > $i] :
( ( X1 @ ( epsii @ X1 ) )
| ~ ( X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_11,plain,
! [X4: $i > $i,X2: $i > $i] : ( epred2_3 @ X2 @ ~ $true @ X4 @ X2 ),
inference(er,[status(thm)],[c_0_6]) ).
thf(c_0_12,plain,
! [X4: $i > $i,X3: $o,X2: $i > $i] :
( ( if @ X3 @ X2 @ X4 )
= ( epsii @ ( epred2_3 @ X4 @ X3 @ X2 ) ) ),
inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_7]),c_0_8]) ).
thf(c_0_13,negated_conjecture,
( ( ~ epred1_0
| epred1_0 )
& ( ( ( if @ $false @ esk1_0 @ esk2_0 )
!= esk1_0 )
| epred1_0 )
& ( ~ epred1_0
| ( ( if @ $true @ esk1_0 @ esk2_0 )
!= esk1_0 ) )
& ( ( ( if @ $false @ esk1_0 @ esk2_0 )
!= esk1_0 )
| ( ( if @ $true @ esk1_0 @ esk2_0 )
!= esk1_0 ) )
& ( ~ epred1_0
| epred1_0 )
& ( ( ( if @ $false @ esk1_0 @ esk2_0 )
!= esk2_0 )
| epred1_0 )
& ( ~ epred1_0
| ( ( if @ $true @ esk1_0 @ esk2_0 )
!= esk2_0 ) )
& ( ( ( if @ $false @ esk1_0 @ esk2_0 )
!= esk2_0 )
| ( ( if @ $true @ esk1_0 @ esk2_0 )
!= esk2_0 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])])]) ).
thf(c_0_14,plain,
! [X5: $i > $i,X4: $i > $i,X2: $i > $i] :
( ( X2 = X4 )
| ~ ( epred2_3 @ X4 @ ~ $true @ X5 @ X2 ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3])])]) ).
thf(c_0_15,plain,
! [X4: $i > $i,X2: $i > $i] : ( epred2_3 @ X2 @ ~ $true @ X4 @ ( if @ ~ $true @ X4 @ X2 ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
thf(c_0_16,plain,
! [X2: $i > $i,X5: $i > $i,X4: $i > $i] :
( ( epred2_3 @ X5 @ $true @ X4 @ X2 )
| ( X2 != X4 ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3])])]) ).
thf(c_0_17,negated_conjecture,
( epred1_0
| ( ( if @ ~ $true @ esk1_0 @ esk2_0 )
!= esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_18,plain,
! [X2: $i > $i,X4: $i > $i] :
( ( if @ ~ $true @ X2 @ X4 )
= X4 ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_19,plain,
! [X2: $i > $i,X4: $i > $i] : ( epred2_3 @ X2 @ $true @ X4 @ X4 ),
inference(er,[status(thm)],[c_0_16]) ).
thf(c_0_20,negated_conjecture,
( ~ epred1_0
| ( ( if @ $true @ esk1_0 @ esk2_0 )
!= esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_21,negated_conjecture,
epred1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
thf(c_0_22,plain,
! [X5: $i > $i,X4: $i > $i,X2: $i > $i] :
( ( X2 = X4 )
| ~ ( epred2_3 @ X5 @ $true @ X4 @ X2 ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3])])]) ).
thf(c_0_23,plain,
! [X4: $i > $i,X2: $i > $i] : ( epred2_3 @ X2 @ $true @ X4 @ ( if @ $true @ X4 @ X2 ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_19]),c_0_12]) ).
thf(c_0_24,negated_conjecture,
( ( if @ $true @ esk1_0 @ esk2_0 )
!= esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
thf(c_0_25,plain,
! [X4: $i > $i,X2: $i > $i] :
( ( if @ $true @ X2 @ X4 )
= X2 ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYO542^1 : TPTP v8.2.0. Released v5.2.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n022.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 : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 10:36:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/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/benchmark/theBenchmark.p
% 0.20/0.48 # Version: 3.1.0-ho
% 0.20/0.48 # Preprocessing class: HSSSSMSSSSSCHSA.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_2 with 300s (1) cores
% 0.20/0.48 # new_ho_10 with pid 29394 completed with status 0
% 0.20/0.48 # Result found by new_ho_10
% 0.20/0.48 # Preprocessing class: HSSSSMSSSSSCHSA.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: HGHSF-FFSF33-SHSFFFBC
% 0.20/0.48 # partial match(1): HGHSF-FFSF33-SHSFFSBC
% 0.20/0.48 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.48 # Starting new_ho_10 with 901s (1) cores
% 0.20/0.48 # Starting sh5l with 151s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 151s (1) cores
% 0.20/0.48 # Starting new_bool_2 with 151s (1) cores
% 0.20/0.48 # Starting new_bool_9 with 146s (1) cores
% 0.20/0.48 # new_ho_10 with pid 29401 completed with status 0
% 0.20/0.48 # Result found by new_ho_10
% 0.20/0.48 # Preprocessing class: HSSSSMSSSSSCHSA.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: HGHSF-FFSF33-SHSFFFBC
% 0.20/0.48 # partial match(1): HGHSF-FFSF33-SHSFFSBC
% 0.20/0.48 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.48 # Starting new_ho_10 with 901s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48 # Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Theorem
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.48 # Parsed axioms : 5
% 0.20/0.48 # Removed by relevancy pruning/SinE : 0
% 0.20/0.48 # Initial clauses : 18
% 0.20/0.48 # Removed in clause preprocessing : 5
% 0.20/0.48 # Initial clauses in saturation : 13
% 0.20/0.48 # Processed clauses : 70
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 4
% 0.20/0.48 # ...remaining for further processing : 66
% 0.20/0.48 # Other redundant clauses eliminated : 2
% 0.20/0.48 # Clauses deleted for lack of memory : 0
% 0.20/0.48 # Backward-subsumed : 5
% 0.20/0.48 # Backward-rewritten : 18
% 0.20/0.48 # Generated clauses : 47
% 0.20/0.48 # ...of the previous two non-redundant : 54
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 0
% 0.20/0.48 # Paramodulations : 12
% 0.20/0.48 # Factorizations : 0
% 0.20/0.48 # NegExts : 19
% 0.20/0.48 # Equation resolutions : 2
% 0.20/0.48 # Disequality decompositions : 0
% 0.20/0.48 # Total rewrite steps : 27
% 0.20/0.48 # ...of those cached : 12
% 0.20/0.48 # Propositional unsat checks : 0
% 0.20/0.48 # Propositional check models : 0
% 0.20/0.48 # Propositional check unsatisfiable : 0
% 0.20/0.48 # Propositional clauses : 0
% 0.20/0.48 # Propositional clauses after purity: 0
% 0.20/0.48 # Propositional unsat core size : 0
% 0.20/0.48 # Propositional preprocessing time : 0.000
% 0.20/0.48 # Propositional encoding time : 0.000
% 0.20/0.48 # Propositional solver time : 0.000
% 0.20/0.48 # Success case prop preproc time : 0.000
% 0.20/0.48 # Success case prop encoding time : 0.000
% 0.20/0.48 # Success case prop solver time : 0.000
% 0.20/0.48 # Current number of processed clauses : 28
% 0.20/0.48 # Positive orientable unit clauses : 7
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 6
% 0.20/0.48 # Non-unit-clauses : 15
% 0.20/0.48 # Current number of unprocessed clauses: 9
% 0.20/0.48 # ...number of literals in the above : 19
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 36
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 85
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 59
% 0.20/0.48 # Non-unit clause-clause subsumptions : 3
% 0.20/0.48 # Unit Clause-clause subsumption calls : 34
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 30
% 0.20/0.48 # BW rewrite match successes : 8
% 0.20/0.48 # Condensation attempts : 70
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 1487
% 0.20/0.48 # Search garbage collected termcells : 243
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.007 s
% 0.20/0.48 # System time : 0.003 s
% 0.20/0.48 # Total time : 0.010 s
% 0.20/0.48 # Maximum resident set size: 1876 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.028 s
% 0.20/0.48 # System time : 0.009 s
% 0.20/0.48 # Total time : 0.038 s
% 0.20/0.48 # Maximum resident set size: 1728 pages
% 0.20/0.48 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------