TSTP Solution File: SEV169^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV169^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 04:07:54 EDT 2024
% Result : Theorem 0.19s 0.47s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 16 ( 9 unt; 4 typ; 0 def)
% Number of atoms : 24 ( 23 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 73 ( 4 ~; 0 |; 10 &; 57 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 40 ( 40 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 82 ( 76 ^ 6 !; 0 ?; 82 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
esk1_0: ( a > a > a ) > a ).
thf(decl_23,type,
esk2_0: ( a > a > a ) > a ).
thf(decl_24,type,
esk3_2: a > a > a ).
thf(cTHM188_pme,conjecture,
! [X1: ( a > a > a ) > a,X2: ( a > a > a ) > a] :
( ( ( X1
= ( ^ [X3: a > a > a] :
( X3
@ ( X1
@ ^ [X4: a,X5: a] : X4 )
@ ( X1
@ ^ [X4: a,X5: a] : X5 ) ) ) )
& ( X2
= ( ^ [X3: a > a > a] :
( X3
@ ( X2
@ ^ [X4: a,X5: a] : X4 )
@ ( X2
@ ^ [X4: a,X5: a] : X5 ) ) ) )
& ( ( X1
@ ^ [X4: a,X5: a] : X4 )
= ( X2
@ ^ [X4: a,X5: a] : X4 ) )
& ( ( X1
@ ^ [X4: a,X5: a] : X5 )
= ( X2
@ ^ [X4: a,X5: a] : X5 ) ) )
=> ( X1 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM188_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: ( a > a > a ) > a,X2: ( a > a > a ) > a] :
( ( ( X1
= ( ^ [Z0: a > a > a] :
( Z0
@ ( X1
@ ^ [Z1: a,Z2: a] : Z1 )
@ ( X1
@ ^ [Z1: a,Z2: a] : Z2 ) ) ) )
& ( X2
= ( ^ [Z0: a > a > a] :
( Z0
@ ( X2
@ ^ [Z1: a,Z2: a] : Z1 )
@ ( X2
@ ^ [Z1: a,Z2: a] : Z2 ) ) ) )
& ( ( X1
@ ^ [Z0: a,Z1: a] : Z0 )
= ( X2
@ ^ [Z0: a,Z1: a] : Z0 ) )
& ( ( X1
@ ^ [Z0: a,Z1: a] : Z1 )
= ( X2
@ ^ [Z0: a,Z1: a] : Z1 ) ) )
=> ( X1 = X2 ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM188_pme])]) ).
thf(c_0_2,negated_conjecture,
( ( esk1_0
= ( ^ [Z0: a > a > a] :
( Z0
@ ( esk1_0
@ ^ [Z1: a,Z2: a] : Z1 )
@ ( esk1_0
@ ^ [Z1: a,Z2: a] : Z2 ) ) ) )
& ( esk2_0
= ( ^ [Z0: a > a > a] :
( Z0
@ ( esk2_0
@ ^ [Z1: a,Z2: a] : Z1 )
@ ( esk2_0
@ ^ [Z1: a,Z2: a] : Z2 ) ) ) )
& ( ( esk1_0
@ ^ [Z0: a,Z1: a] : Z0 )
= ( esk2_0
@ ^ [Z0: a,Z1: a] : Z0 ) )
& ( ( esk1_0
@ ^ [Z0: a,Z1: a] : Z1 )
= ( esk2_0
@ ^ [Z0: a,Z1: a] : Z1 ) )
& ( esk1_0 != esk2_0 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).
thf(c_0_3,negated_conjecture,
( esk1_0
= ( ^ [Z0: a > a > a] :
( Z0
@ ( esk1_0
@ ^ [Z1: a,Z2: a] : Z1 )
@ ( esk1_0
@ ^ [Z1: a,Z2: a] : Z2 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( ( esk1_0
@ ^ [Z0: a,Z1: a] : Z0 )
= ( esk2_0
@ ^ [Z0: a,Z1: a] : Z0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
( ( esk1_0
@ ^ [Z0: a,Z1: a] : Z1 )
= ( esk2_0
@ ^ [Z0: a,Z1: a] : Z1 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
( esk2_0
= ( ^ [Z0: a > a > a] :
( Z0
@ ( esk2_0
@ ^ [Z1: a,Z2: a] : Z1 )
@ ( esk2_0
@ ^ [Z1: a,Z2: a] : Z2 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
! [X3: a > a > a] :
( ( X3
@ ( esk2_0
@ ^ [Z0: a,Z1: a] : Z0 )
@ ( esk2_0
@ ^ [Z0: a,Z1: a] : Z1 ) )
= ( esk1_0 @ X3 ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(arg_cong,[status(thm)],[c_0_3]),c_0_4]),c_0_5]) ).
thf(c_0_9,negated_conjecture,
( ( esk1_0 @ esk3_2 )
!= ( esk2_0 @ esk3_2 ) ),
inference(neg_ext,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
! [X3: a > a > a] :
( ( esk1_0 @ X3 )
= ( esk2_0 @ X3 ) ),
inference(rw,[status(thm)],[inference(arg_cong,[status(thm)],[c_0_7]),c_0_8]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEV169^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n011.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 : Sun May 19 18:29:37 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.46 Running higher-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 # Version: 3.1.0-ho
% 0.19/0.47 # Preprocessing class: HSSSSMSSSSLNHHA.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting new_ho_10 with 600s (2) cores
% 0.19/0.47 # Starting sh5l with 600s (2) cores
% 0.19/0.47 # Starting new_bool_1 with 600s (2) cores
% 0.19/0.47 # Starting new_bool_2 with 600s (2) cores
% 0.19/0.47 # new_bool_2 with pid 11133 completed with status 0
% 0.19/0.47 # Result found by new_bool_2
% 0.19/0.47 # Preprocessing class: HSSSSMSSSSLNHHA.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting new_ho_10 with 600s (2) cores
% 0.19/0.47 # Starting sh5l with 600s (2) cores
% 0.19/0.47 # Starting new_bool_1 with 600s (2) cores
% 0.19/0.47 # Starting new_bool_2 with 600s (2) cores
% 0.19/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.47 # Search class: HUUPF-FFSS00-MHHFFFNN
% 0.19/0.47 # partial match(3): HUHPF-FFSF00-SHHFFFNN
% 0.19/0.47 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.19/0.47 # Starting new_ho_10 with 361s (1) cores
% 0.19/0.47 # Starting sh5l with 61s (1) cores
% 0.19/0.47 # new_ho_10 with pid 11135 completed with status 0
% 0.19/0.47 # Result found by new_ho_10
% 0.19/0.47 # Preprocessing class: HSSSSMSSSSLNHHA.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting new_ho_10 with 600s (2) cores
% 0.19/0.47 # Starting sh5l with 600s (2) cores
% 0.19/0.47 # Starting new_bool_1 with 600s (2) cores
% 0.19/0.47 # Starting new_bool_2 with 600s (2) cores
% 0.19/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.47 # Search class: HUUPF-FFSS00-MHHFFFNN
% 0.19/0.47 # partial match(3): HUHPF-FFSF00-SHHFFFNN
% 0.19/0.47 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.19/0.47 # Starting new_ho_10 with 361s (1) cores
% 0.19/0.47 # Preprocessing time : 0.001 s
% 0.19/0.47 # Presaturation interreduction done
% 0.19/0.47
% 0.19/0.47 # Proof found!
% 0.19/0.47 # SZS status Theorem
% 0.19/0.47 # SZS output start CNFRefutation
% See solution above
% 0.19/0.47 # Parsed axioms : 2
% 0.19/0.47 # Removed by relevancy pruning/SinE : 1
% 0.19/0.47 # Initial clauses : 5
% 0.19/0.47 # Removed in clause preprocessing : 0
% 0.19/0.47 # Initial clauses in saturation : 5
% 0.19/0.47 # Processed clauses : 13
% 0.19/0.47 # ...of these trivial : 0
% 0.19/0.47 # ...subsumed : 0
% 0.19/0.47 # ...remaining for further processing : 13
% 0.19/0.47 # Other redundant clauses eliminated : 0
% 0.19/0.47 # Clauses deleted for lack of memory : 0
% 0.19/0.47 # Backward-subsumed : 0
% 0.19/0.47 # Backward-rewritten : 2
% 0.19/0.47 # Generated clauses : 4
% 0.19/0.47 # ...of the previous two non-redundant : 4
% 0.19/0.47 # ...aggressively subsumed : 0
% 0.19/0.47 # Contextual simplify-reflections : 0
% 0.19/0.47 # Paramodulations : 0
% 0.19/0.47 # Factorizations : 0
% 0.19/0.47 # NegExts : 1
% 0.19/0.47 # Equation resolutions : 0
% 0.19/0.47 # Disequality decompositions : 0
% 0.19/0.47 # Total rewrite steps : 5
% 0.19/0.47 # ...of those cached : 0
% 0.19/0.47 # Propositional unsat checks : 0
% 0.19/0.47 # Propositional check models : 0
% 0.19/0.47 # Propositional check unsatisfiable : 0
% 0.19/0.47 # Propositional clauses : 0
% 0.19/0.47 # Propositional clauses after purity: 0
% 0.19/0.47 # Propositional unsat core size : 0
% 0.19/0.47 # Propositional preprocessing time : 0.000
% 0.19/0.47 # Propositional encoding time : 0.000
% 0.19/0.47 # Propositional solver time : 0.000
% 0.19/0.47 # Success case prop preproc time : 0.000
% 0.19/0.47 # Success case prop encoding time : 0.000
% 0.19/0.47 # Success case prop solver time : 0.000
% 0.19/0.47 # Current number of processed clauses : 6
% 0.19/0.47 # Positive orientable unit clauses : 5
% 0.19/0.47 # Positive unorientable unit clauses: 0
% 0.19/0.47 # Negative unit clauses : 1
% 0.19/0.47 # Non-unit-clauses : 0
% 0.19/0.47 # Current number of unprocessed clauses: 0
% 0.19/0.47 # ...number of literals in the above : 0
% 0.19/0.47 # Current number of archived formulas : 0
% 0.19/0.47 # Current number of archived clauses : 7
% 0.19/0.47 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.47 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.47 # Non-unit clause-clause subsumptions : 0
% 0.19/0.47 # Unit Clause-clause subsumption calls : 1
% 0.19/0.47 # Rewrite failures with RHS unbound : 0
% 0.19/0.47 # BW rewrite match attempts : 20
% 0.19/0.47 # BW rewrite match successes : 2
% 0.19/0.47 # Condensation attempts : 13
% 0.19/0.47 # Condensation successes : 0
% 0.19/0.47 # Termbank termtop insertions : 415
% 0.19/0.47 # Search garbage collected termcells : 77
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.003 s
% 0.19/0.47 # System time : 0.001 s
% 0.19/0.47 # Total time : 0.004 s
% 0.19/0.47 # Maximum resident set size: 1788 pages
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.005 s
% 0.19/0.47 # System time : 0.003 s
% 0.19/0.47 # Total time : 0.008 s
% 0.19/0.47 # Maximum resident set size: 1732 pages
% 0.19/0.47 % E---3.1 exiting
% 0.19/0.47 % E exiting
%------------------------------------------------------------------------------