TSTP Solution File: SYO265^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO265^5 : TPTP v8.2.0. Released v4.0.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 : Tue May 21 08:45:18 EDT 2024
% Result : Theorem 0.18s 0.47s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 15 ( 8 unt; 4 typ; 0 def)
% Number of atoms : 27 ( 23 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 16 ( 4 ~; 2 |; 5 &; 4 @)
% ( 0 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 5 con; 0-2 aty)
% Number of variables : 11 ( 6 ^ 0 !; 5 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
x: a ).
thf(decl_23,type,
esk1_0: a ).
thf(decl_24,type,
esk2_0: a ).
thf(cX5210,conjecture,
( ( ^ [X1: a,X2: a] : ( X1 = X2 )
@ x )
= ( ^ [X3: a] :
? [X2: a] :
( ( X2 = x )
& ( X3 = X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cX5210) ).
thf(c_0_1,negated_conjecture,
( ( $eq @ x )
!= ( ^ [Z0: a] :
? [X2: a] :
( ( X2 = x )
& ( Z0 = X2 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cX5210])])])]) ).
thf(c_0_2,negated_conjecture,
( ( $eq @ x )
!= ( ^ [Z0: a] :
? [X2: a] :
( ( X2 = x )
& ( Z0 = X2 ) ) ) ),
inference(fof_nnf,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
( ( $eq @ x )
!= ( ^ [Z0: a] :
? [X7: a] :
( ( X7 = x )
& ( Z0 = X7 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( ? [X8: a] :
( ( X8 = x )
& ( esk1_0 = X8 ) )
<~> ( x = esk1_0 ) ),
inference(neg_ext,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
( ( x = esk1_0 )
| ( x = esk2_0 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
x != esk1_0,
inference(er,[status(thm)],[inference(local_rw,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_4])])])]) ).
thf(c_0_7,negated_conjecture,
( ( x = esk1_0 )
| ( esk1_0 = esk2_0 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
x = esk2_0,
inference(sr,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
esk1_0 = esk2_0,
inference(sr,[status(thm)],[c_0_7,c_0_6]) ).
thf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_8]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYO265^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 20 10:35:08 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.46 Running higher-order theorem proving
% 0.18/0.46 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.18/0.47 # Version: 3.1.0-ho
% 0.18/0.47 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.18/0.47 # Starting post_as_ho10 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_9 with 300s (1) cores
% 0.18/0.47 # Starting sh5l with 300s (1) cores
% 0.18/0.47 # sh5l with pid 17683 completed with status 0
% 0.18/0.47 # Result found by sh5l
% 0.18/0.47 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.18/0.47 # Starting post_as_ho10 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_9 with 300s (1) cores
% 0.18/0.47 # Starting sh5l with 300s (1) cores
% 0.18/0.47 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.47 # Search class: HUUPF-FFSF00-MSSFFFNN
% 0.18/0.47 # partial match(1): HUUPF-FFSF00-SSSFFFNN
% 0.18/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting new_ho_10 with 181s (1) cores
% 0.18/0.47 # new_ho_10 with pid 17684 completed with status 0
% 0.18/0.47 # Result found by new_ho_10
% 0.18/0.47 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.18/0.47 # Starting post_as_ho10 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_9 with 300s (1) cores
% 0.18/0.47 # Starting sh5l with 300s (1) cores
% 0.18/0.47 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.47 # Search class: HUUPF-FFSF00-MSSFFFNN
% 0.18/0.47 # partial match(1): HUUPF-FFSF00-SSSFFFNN
% 0.18/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting new_ho_10 with 181s (1) cores
% 0.18/0.47 # Preprocessing time : 0.001 s
% 0.18/0.47 # Presaturation interreduction done
% 0.18/0.47
% 0.18/0.47 # Proof found!
% 0.18/0.47 # SZS status Theorem
% 0.18/0.47 # SZS output start CNFRefutation
% See solution above
% 0.18/0.47 # Parsed axioms : 3
% 0.18/0.47 # Removed by relevancy pruning/SinE : 2
% 0.18/0.47 # Initial clauses : 1
% 0.18/0.47 # Removed in clause preprocessing : 0
% 0.18/0.47 # Initial clauses in saturation : 1
% 0.18/0.47 # Processed clauses : 9
% 0.18/0.47 # ...of these trivial : 0
% 0.18/0.47 # ...subsumed : 0
% 0.18/0.47 # ...remaining for further processing : 8
% 0.18/0.47 # Other redundant clauses eliminated : 1
% 0.18/0.47 # Clauses deleted for lack of memory : 0
% 0.18/0.47 # Backward-subsumed : 0
% 0.18/0.47 # Backward-rewritten : 2
% 0.18/0.47 # Generated clauses : 8
% 0.18/0.47 # ...of the previous two non-redundant : 9
% 0.18/0.47 # ...aggressively subsumed : 0
% 0.18/0.47 # Contextual simplify-reflections : 0
% 0.18/0.47 # Paramodulations : 0
% 0.18/0.47 # Factorizations : 1
% 0.18/0.47 # NegExts : 1
% 0.18/0.47 # Equation resolutions : 1
% 0.18/0.47 # Disequality decompositions : 0
% 0.18/0.47 # Total rewrite steps : 3
% 0.18/0.47 # ...of those cached : 1
% 0.18/0.47 # Propositional unsat checks : 0
% 0.18/0.47 # Propositional check models : 0
% 0.18/0.47 # Propositional check unsatisfiable : 0
% 0.18/0.47 # Propositional clauses : 0
% 0.18/0.47 # Propositional clauses after purity: 0
% 0.18/0.47 # Propositional unsat core size : 0
% 0.18/0.47 # Propositional preprocessing time : 0.000
% 0.18/0.47 # Propositional encoding time : 0.000
% 0.18/0.47 # Propositional solver time : 0.000
% 0.18/0.47 # Success case prop preproc time : 0.000
% 0.18/0.47 # Success case prop encoding time : 0.000
% 0.18/0.47 # Success case prop solver time : 0.000
% 0.18/0.47 # Current number of processed clauses : 2
% 0.18/0.47 # Positive orientable unit clauses : 2
% 0.18/0.47 # Positive unorientable unit clauses: 0
% 0.18/0.47 # Negative unit clauses : 0
% 0.18/0.47 # Non-unit-clauses : 0
% 0.18/0.47 # Current number of unprocessed clauses: 2
% 0.18/0.47 # ...number of literals in the above : 3
% 0.18/0.47 # Current number of archived formulas : 0
% 0.18/0.47 # Current number of archived clauses : 6
% 0.18/0.47 # Clause-clause subsumption calls (NU) : 0
% 0.18/0.47 # Rec. Clause-clause subsumption calls : 0
% 0.18/0.47 # Non-unit clause-clause subsumptions : 0
% 0.18/0.47 # Unit Clause-clause subsumption calls : 1
% 0.18/0.47 # Rewrite failures with RHS unbound : 0
% 0.18/0.47 # BW rewrite match attempts : 1
% 0.18/0.47 # BW rewrite match successes : 1
% 0.18/0.47 # Condensation attempts : 10
% 0.18/0.47 # Condensation successes : 0
% 0.18/0.47 # Termbank termtop insertions : 290
% 0.18/0.47 # Search garbage collected termcells : 23
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.004 s
% 0.18/0.47 # System time : 0.000 s
% 0.18/0.47 # Total time : 0.004 s
% 0.18/0.47 # Maximum resident set size: 1624 pages
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.004 s
% 0.18/0.47 # System time : 0.003 s
% 0.18/0.47 # Total time : 0.007 s
% 0.18/0.47 # Maximum resident set size: 1712 pages
% 0.18/0.47 % E---3.1 exiting
% 0.18/0.47 % E exiting
%------------------------------------------------------------------------------