TSTP Solution File: SYO238^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO238^5 : TPTP v8.2.0. Released v4.0.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 : Tue May 21 08:45:14 EDT 2024
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 13 ( 4 unt; 4 typ; 0 def)
% Number of atoms : 26 ( 10 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 43 ( 8 ~; 4 |; 3 &; 18 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 15 ( 10 ^ 5 !; 0 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
cB: $o ).
thf(decl_23,type,
x: $i ).
thf(decl_24,type,
cP: $i > $o ).
thf(decl_25,type,
f: $i > $i ).
thf(cADDHYP5,conjecture,
( ( $true
=> ! [X1: $i] :
( ( f @ X1 )
= X1 ) )
=> ( ( ( ( ^ [X1: $i] : ( f @ ( f @ X1 ) ) )
= ( ^ [X1: $i] : X1 ) )
=> cB )
=> ( ( cP @ x )
=> cB ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cADDHYP5) ).
thf(c_0_1,negated_conjecture,
~ ( ( $true
=> ! [X1: $i] :
( ( f @ X1 )
= X1 ) )
=> ( ( ( ( ^ [Z0: $i] : ( f @ ( f @ Z0 ) ) )
= ( ^ [Z0: $i] : Z0 ) )
=> cB )
=> ( ( cP @ x )
=> cB ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cADDHYP5])]) ).
thf(c_0_2,negated_conjecture,
! [X3: $i] :
( ( ~ $true
| ( ( f @ X3 )
= X3 ) )
& ( ( ( ^ [Z0: $i] : ( f @ ( f @ Z0 ) ) )
!= ( ^ [Z0: $i] : Z0 ) )
| cB )
& ( cP @ x )
& ~ cB ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).
thf(c_0_3,negated_conjecture,
( cB
| ( ( ^ [Z0: $i] : ( f @ ( f @ Z0 ) ) )
!= ( ^ [Z0: $i] : Z0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
~ cB,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: $i] :
( ( ( f @ X1 )
= X1 )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
( ( ^ [Z0: $i] : ( f @ ( f @ Z0 ) ) )
!= ( ^ [Z0: $i] : Z0 ) ),
inference(sr,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i] :
( ( f @ X1 )
= X1 ),
inference(cn,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_6]),c_0_7]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SYO238^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n010.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 09:21:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running higher-order theorem proving
% 0.19/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/benchmark/theBenchmark.p
% 0.19/0.49 # Version: 3.1.0-ho
% 0.19/0.49 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.19/0.49 # Starting post_as_ho10 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_9 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # sh5l with pid 21507 completed with status 0
% 0.19/0.49 # Result found by sh5l
% 0.19/0.49 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.19/0.49 # Starting post_as_ho10 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_9 with 300s (1) 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-FFSF11-MSSFFFNN
% 0.19/0.49 # partial match(1): HHUSF-FFSF11-SSSFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting sh3 with 181s (1) cores
% 0.19/0.49 # sh3 with pid 21513 completed with status 0
% 0.19/0.49 # Result found by sh3
% 0.19/0.49 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.19/0.49 # Starting post_as_ho10 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_9 with 300s (1) 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-FFSF11-MSSFFFNN
% 0.19/0.49 # partial match(1): HHUSF-FFSF11-SSSFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting sh3 with 181s (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 : 4
% 0.19/0.49 # Initial clauses : 4
% 0.19/0.49 # Removed in clause preprocessing : 0
% 0.19/0.49 # Initial clauses in saturation : 4
% 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 : 8
% 0.19/0.49 # Other redundant clauses eliminated : 0
% 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 : 1
% 0.19/0.49 # ...of the previous two non-redundant : 0
% 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 : 0
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 2
% 0.19/0.49 # ...of those cached : 1
% 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 : 2
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 2
% 0.19/0.49 # Non-unit-clauses : 0
% 0.19/0.49 # Current number of unprocessed clauses: 0
% 0.19/0.49 # ...number of literals in the above : 0
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 4
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 0
% 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 : 0
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 252
% 0.19/0.49 # Search garbage collected termcells : 65
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.001 s
% 0.19/0.49 # System time : 0.002 s
% 0.19/0.49 # Total time : 0.003 s
% 0.19/0.49 # Maximum resident set size: 1780 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.002 s
% 0.19/0.49 # System time : 0.003 s
% 0.19/0.49 # Total time : 0.005 s
% 0.19/0.49 # Maximum resident set size: 1700 pages
% 0.19/0.49 % E---3.1 exiting
% 0.19/0.49 % E exiting
%------------------------------------------------------------------------------