TSTP Solution File: SEV196^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV196^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:58 EDT 2024
% Result : Theorem 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 17 ( 4 unt; 6 typ; 0 def)
% Number of atoms : 49 ( 28 equ; 0 cnn)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 198 ( 23 ~; 24 |; 18 &; 129 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 12 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 5 con; 0-3 aty)
% Number of variables : 52 ( 0 ^ 40 !; 12 ?; 52 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
y: a ).
thf(decl_23,type,
x: a ).
thf(decl_24,type,
cP: a > a > a ).
thf(decl_25,type,
c0: a ).
thf(decl_26,type,
epred1_0: a > a > a > $o ).
thf(cS_JOIN_LEM2_pme,conjecture,
! [X1: a > a > a > $o] :
( ( $true
& ! [X2: a,X3: a,X4: a] :
( ( ( ( X2 = c0 )
& ( X3 = X4 ) )
| ( ( X3 = c0 )
& ( X2 = X4 ) )
| ? [X5: a,X6: a,X7: a,X8: a,X9: a,X10: a] :
( ( X2
= ( cP @ X5 @ X6 ) )
& ( X3
= ( cP @ X7 @ X8 ) )
& ( X4
= ( cP @ X9 @ X10 ) )
& ( X1 @ X5 @ X7 @ X9 )
& ( X1 @ X6 @ X8 @ X10 ) ) )
=> ( X1 @ X2 @ X3 @ X4 ) ) )
=> ( X1 @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cS_JOIN_LEM2_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > a > a > $o] :
( ( $true
& ! [X2: a,X3: a,X4: a] :
( ( ( ( X2 = c0 )
& ( X3 = X4 ) )
| ( ( X3 = c0 )
& ( X2 = X4 ) )
| ? [X5: a,X6: a,X7: a,X8: a,X9: a,X10: a] :
( ( X2
= ( cP @ X5 @ X6 ) )
& ( X3
= ( cP @ X7 @ X8 ) )
& ( X4
= ( cP @ X9 @ X10 ) )
& ( X1 @ X5 @ X7 @ X9 )
& ( X1 @ X6 @ X8 @ X10 ) ) )
=> ( X1 @ X2 @ X3 @ X4 ) ) )
=> ( X1 @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) ) ),
inference(assume_negation,[status(cth)],[cS_JOIN_LEM2_pme]) ).
thf(c_0_2,negated_conjecture,
! [X22: a,X23: a,X24: a,X25: a,X26: a,X27: a,X28: a,X29: a,X30: a] :
( $true
& ( ( X22 != c0 )
| ( X23 != X24 )
| ( epred1_0 @ X22 @ X23 @ X24 ) )
& ( ( X23 != c0 )
| ( X22 != X24 )
| ( epred1_0 @ X22 @ X23 @ X24 ) )
& ( ( X22
!= ( cP @ X25 @ X26 ) )
| ( X23
!= ( cP @ X27 @ X28 ) )
| ( X24
!= ( cP @ X29 @ X30 ) )
| ~ ( epred1_0 @ X25 @ X27 @ X29 )
| ~ ( epred1_0 @ X26 @ X28 @ X30 )
| ( epred1_0 @ X22 @ X23 @ X24 ) )
& ~ ( epred1_0 @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X2: a,X3: a,X5: a,X6: a,X4: a,X8: a,X7: a,X9: a,X10: a] :
( ( epred1_0 @ X2 @ X5 @ X8 )
| ( X2
!= ( cP @ X3 @ X4 ) )
| ( X5
!= ( cP @ X6 @ X7 ) )
| ( X8
!= ( cP @ X9 @ X10 ) )
| ~ ( epred1_0 @ X3 @ X6 @ X9 )
| ~ ( epred1_0 @ X4 @ X7 @ X10 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X2: a,X3: a,X4: a] :
( ( epred1_0 @ X2 @ X3 @ X4 )
| ( X2 != c0 )
| ( X3 != X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X2: a,X3: a,X4: a] :
( ( epred1_0 @ X3 @ X2 @ X4 )
| ( X2 != c0 )
| ( X3 != X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
~ ( epred1_0 @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X3: a,X2: a,X5: a,X4: a,X7: a,X6: a] :
( ( epred1_0 @ ( cP @ X2 @ X3 ) @ ( cP @ X4 @ X5 ) @ ( cP @ X6 @ X7 ) )
| ~ ( epred1_0 @ X3 @ X5 @ X7 )
| ~ ( epred1_0 @ X2 @ X4 @ X6 ) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_3])])]) ).
thf(c_0_8,negated_conjecture,
! [X2: a] : ( epred1_0 @ c0 @ X2 @ X2 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_4])]) ).
thf(c_0_9,negated_conjecture,
! [X2: a] : ( epred1_0 @ X2 @ c0 @ X2 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_5])]) ).
thf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEV196^5 : TPTP v8.2.0. Released v4.0.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n008.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 : Sun May 19 18:51:52 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running higher-order theorem proving
% 0.19/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.19/0.48 # Version: 3.1.0-ho
% 0.19/0.48 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.19/0.48 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting post_as_ho12 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_9 with 300s (1) cores
% 0.19/0.48 # Starting post_as_ho1 with 300s (1) cores
% 0.19/0.48 # Starting post_as_ho4 with 300s (1) cores
% 0.19/0.48 # Starting post_as_ho2 with 300s (1) cores
% 0.19/0.48 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.19/0.48 # Starting full_lambda_10 with 300s (1) cores
% 0.19/0.48 # Starting new_ho_8 with 300s (1) cores
% 0.19/0.48 # post_as_ho12 with pid 27887 completed with status 0
% 0.19/0.48 # Result found by post_as_ho12
% 0.19/0.48 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.19/0.48 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting post_as_ho12 with 300s (1) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: HHUSF-FFSF22-SSSFFFNN
% 0.19/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.48 # new_ho_10 with pid 27896 completed with status 0
% 0.19/0.48 # Result found by new_ho_10
% 0.19/0.48 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.19/0.48 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting post_as_ho12 with 300s (1) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: HHUSF-FFSF22-SSSFFFNN
% 0.19/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Theorem
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 6
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 10
% 0.19/0.48 # Removed in clause preprocessing : 6
% 0.19/0.48 # Initial clauses in saturation : 4
% 0.19/0.48 # Processed clauses : 11
% 0.19/0.48 # ...of these trivial : 0
% 0.19/0.48 # ...subsumed : 0
% 0.19/0.48 # ...remaining for further processing : 11
% 0.19/0.48 # Other redundant clauses eliminated : 7
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 0
% 0.19/0.48 # Backward-rewritten : 0
% 0.19/0.48 # Generated clauses : 4
% 0.19/0.48 # ...of the previous two non-redundant : 3
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 0
% 0.19/0.48 # Paramodulations : 1
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 7
% 0.19/0.48 # Disequality decompositions : 0
% 0.19/0.48 # Total rewrite steps : 2
% 0.19/0.48 # ...of those cached : 0
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 4
% 0.19/0.48 # Positive orientable unit clauses : 2
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 1
% 0.19/0.48 # Non-unit-clauses : 1
% 0.19/0.48 # Current number of unprocessed clauses: 0
% 0.19/0.48 # ...number of literals in the above : 0
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 4
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 13
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 6
% 0.19/0.48 # Non-unit clause-clause subsumptions : 0
% 0.19/0.48 # Unit Clause-clause subsumption calls : 0
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 0
% 0.19/0.48 # BW rewrite match successes : 0
% 0.19/0.48 # Condensation attempts : 11
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 938
% 0.19/0.48 # Search garbage collected termcells : 303
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.005 s
% 0.19/0.48 # System time : 0.000 s
% 0.19/0.48 # Total time : 0.005 s
% 0.19/0.48 # Maximum resident set size: 1760 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.006 s
% 0.19/0.48 # System time : 0.002 s
% 0.19/0.48 # Total time : 0.008 s
% 0.19/0.48 # Maximum resident set size: 1720 pages
% 0.19/0.48 % E---3.1 exiting
% 0.19/0.48 % E exiting
%------------------------------------------------------------------------------