TSTP Solution File: ITP124^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP124^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 : Mon May 20 22:16:25 EDT 2024
% Result : Theorem 0.55s 0.54s
% Output : CNFRefutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 13
% Syntax : Number of formulae : 28 ( 21 unt; 7 typ; 0 def)
% Number of atoms : 21 ( 20 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 175 ( 3 ~; 0 |; 0 &; 172 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 4 con; 0-5 aty)
% Number of variables : 42 ( 0 ^ 42 !; 0 ?; 42 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_34,type,
modula1144073633_aux_a: ( a > a > a ) > ( a > a > a ) > a > a > a > a ).
thf(decl_55,type,
a2: a ).
thf(decl_56,type,
b: a ).
thf(decl_57,type,
c: a ).
thf(decl_58,type,
inf: a > a > a ).
thf(decl_60,type,
sup: a > a > a ).
thf(conj_0,conjecture,
( ( modula1144073633_aux_a @ inf @ sup @ b @ c @ a2 )
= ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
thf(fact_14_e__aux__def,axiom,
! [X1: a,X2: a,X3: a] :
( ( modula1144073633_aux_a @ inf @ sup @ X1 @ X2 @ X3 )
= ( inf @ ( inf @ ( sup @ X1 @ X2 ) @ ( sup @ X2 @ X3 ) ) @ ( sup @ X3 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_14_e__aux__def) ).
thf(fact_0_local_Oinf_Oassoc,axiom,
! [X1: a,X2: a,X3: a] :
( ( inf @ ( inf @ X1 @ X2 ) @ X3 )
= ( inf @ X1 @ ( inf @ X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_local_Oinf_Oassoc) ).
thf(fact_7_local_Osup_Ocommute,axiom,
! [X1: a,X2: a] :
( ( sup @ X1 @ X2 )
= ( sup @ X2 @ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_7_local_Osup_Ocommute) ).
thf(fact_2_local_Oinf_Oleft__commute,axiom,
! [X2: a,X1: a,X3: a] :
( ( inf @ X2 @ ( inf @ X1 @ X3 ) )
= ( inf @ X1 @ ( inf @ X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2_local_Oinf_Oleft__commute) ).
thf(fact_1_local_Oinf_Ocommute,axiom,
! [X1: a,X2: a] :
( ( inf @ X1 @ X2 )
= ( inf @ X2 @ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1_local_Oinf_Ocommute) ).
thf(c_0_6,negated_conjecture,
( ( modula1144073633_aux_a @ inf @ sup @ b @ c @ a2 )
!= ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_7,plain,
! [X636: a,X637: a,X638: a] :
( ( modula1144073633_aux_a @ inf @ sup @ X636 @ X637 @ X638 )
= ( inf @ ( inf @ ( sup @ X636 @ X637 ) @ ( sup @ X637 @ X638 ) ) @ ( sup @ X638 @ X636 ) ) ),
inference(variable_rename,[status(thm)],[fact_14_e__aux__def]) ).
thf(c_0_8,plain,
! [X796: a,X797: a,X798: a] :
( ( inf @ ( inf @ X796 @ X797 ) @ X798 )
= ( inf @ X796 @ ( inf @ X797 @ X798 ) ) ),
inference(variable_rename,[status(thm)],[fact_0_local_Oinf_Oassoc]) ).
thf(c_0_9,negated_conjecture,
( ( modula1144073633_aux_a @ inf @ sup @ b @ c @ a2 )
!= ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
! [X3: a,X2: a,X1: a] :
( ( modula1144073633_aux_a @ inf @ sup @ X1 @ X2 @ X3 )
= ( inf @ ( inf @ ( sup @ X1 @ X2 ) @ ( sup @ X2 @ X3 ) ) @ ( sup @ X3 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
! [X1: a,X2: a,X3: a] :
( ( inf @ ( inf @ X1 @ X2 ) @ X3 )
= ( inf @ X1 @ ( inf @ X2 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
! [X642: a,X643: a] :
( ( sup @ X642 @ X643 )
= ( sup @ X643 @ X642 ) ),
inference(variable_rename,[status(thm)],[fact_7_local_Osup_Ocommute]) ).
thf(c_0_13,plain,
! [X801: a,X802: a,X803: a] :
( ( inf @ X801 @ ( inf @ X802 @ X803 ) )
= ( inf @ X802 @ ( inf @ X801 @ X803 ) ) ),
inference(variable_rename,[status(thm)],[fact_2_local_Oinf_Oleft__commute]) ).
thf(c_0_14,plain,
! [X799: a,X800: a] :
( ( inf @ X799 @ X800 )
= ( inf @ X800 @ X799 ) ),
inference(variable_rename,[status(thm)],[fact_1_local_Oinf_Ocommute]) ).
thf(c_0_15,negated_conjecture,
( ( modula1144073633_aux_a @ inf @ sup @ b @ c @ a2 )
!= ( modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_16,plain,
! [X3: a,X2: a,X1: a] :
( ( modula1144073633_aux_a @ inf @ sup @ X1 @ X2 @ X3 )
= ( inf @ ( sup @ X1 @ X2 ) @ ( inf @ ( sup @ X2 @ X3 ) @ ( sup @ X3 @ X1 ) ) ) ),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_17,plain,
! [X2: a,X1: a] :
( ( sup @ X1 @ X2 )
= ( sup @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_18,plain,
! [X1: a,X2: a,X3: a] :
( ( inf @ X1 @ ( inf @ X2 @ X3 ) )
= ( inf @ X2 @ ( inf @ X1 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_19,plain,
! [X2: a,X1: a] :
( ( inf @ X1 @ X2 )
= ( inf @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18]),c_0_16]),c_0_17]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ITP124^1 : TPTP v8.2.0. Released v7.5.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n019.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 : Sat May 18 15:48:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/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.55/0.54 # Version: 3.1.0-ho
% 0.55/0.54 # Preprocessing class: HSLSSMSSSSMNHSA.
% 0.55/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.55/0.54 # Starting sh1 with 1500s (5) cores
% 0.55/0.54 # Starting new_ho_8 with 300s (1) cores
% 0.55/0.54 # Starting new_ho_11 with 300s (1) cores
% 0.55/0.54 # Starting sh5l with 300s (1) cores
% 0.55/0.54 # new_ho_8 with pid 17827 completed with status 0
% 0.55/0.54 # Result found by new_ho_8
% 0.55/0.54 # Preprocessing class: HSLSSMSSSSMNHSA.
% 0.55/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.55/0.54 # Starting sh1 with 1500s (5) cores
% 0.55/0.54 # Starting new_ho_8 with 300s (1) cores
% 0.55/0.54 # SinE strategy is GSinE(CountTerms,hypos,10,,2,20000,1.0,true)
% 0.55/0.54 # Search class: HGHSM-FSLF31-MHSFFFBN
% 0.55/0.54 # partial match(1): HGHSM-FSLM31-MHSFFFBN
% 0.55/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.55/0.54 # Starting additional_ho_4 with 163s (1) cores
% 0.55/0.54 # additional_ho_4 with pid 17831 completed with status 0
% 0.55/0.54 # Result found by additional_ho_4
% 0.55/0.54 # Preprocessing class: HSLSSMSSSSMNHSA.
% 0.55/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.55/0.54 # Starting sh1 with 1500s (5) cores
% 0.55/0.54 # Starting new_ho_8 with 300s (1) cores
% 0.55/0.54 # SinE strategy is GSinE(CountTerms,hypos,10,,2,20000,1.0,true)
% 0.55/0.54 # Search class: HGHSM-FSLF31-MHSFFFBN
% 0.55/0.54 # partial match(1): HGHSM-FSLM31-MHSFFFBN
% 0.55/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.55/0.54 # Starting additional_ho_4 with 163s (1) cores
% 0.55/0.54 # Preprocessing time : 0.005 s
% 0.55/0.54 # Presaturation interreduction done
% 0.55/0.54
% 0.55/0.54 # Proof found!
% 0.55/0.54 # SZS status Theorem
% 0.55/0.54 # SZS output start CNFRefutation
% See solution above
% 0.55/0.54 # Parsed axioms : 313
% 0.55/0.54 # Removed by relevancy pruning/SinE : 119
% 0.55/0.54 # Initial clauses : 287
% 0.55/0.54 # Removed in clause preprocessing : 7
% 0.55/0.54 # Initial clauses in saturation : 280
% 0.55/0.54 # Processed clauses : 256
% 0.55/0.54 # ...of these trivial : 12
% 0.55/0.54 # ...subsumed : 75
% 0.55/0.54 # ...remaining for further processing : 169
% 0.55/0.54 # Other redundant clauses eliminated : 23
% 0.55/0.54 # Clauses deleted for lack of memory : 0
% 0.55/0.54 # Backward-subsumed : 1
% 0.55/0.54 # Backward-rewritten : 1
% 0.55/0.54 # Generated clauses : 22
% 0.55/0.54 # ...of the previous two non-redundant : 3
% 0.55/0.54 # ...aggressively subsumed : 0
% 0.55/0.54 # Contextual simplify-reflections : 0
% 0.55/0.54 # Paramodulations : 0
% 0.55/0.54 # Factorizations : 0
% 0.55/0.54 # NegExts : 0
% 0.55/0.54 # Equation resolutions : 23
% 0.55/0.54 # Disequality decompositions : 0
% 0.55/0.54 # Total rewrite steps : 41
% 0.55/0.54 # ...of those cached : 15
% 0.55/0.54 # Propositional unsat checks : 0
% 0.55/0.54 # Propositional check models : 0
% 0.55/0.54 # Propositional check unsatisfiable : 0
% 0.55/0.54 # Propositional clauses : 0
% 0.55/0.54 # Propositional clauses after purity: 0
% 0.55/0.54 # Propositional unsat core size : 0
% 0.55/0.54 # Propositional preprocessing time : 0.000
% 0.55/0.54 # Propositional encoding time : 0.000
% 0.55/0.54 # Propositional solver time : 0.000
% 0.55/0.54 # Success case prop preproc time : 0.000
% 0.55/0.54 # Success case prop encoding time : 0.000
% 0.55/0.54 # Success case prop solver time : 0.000
% 0.55/0.54 # Current number of processed clauses : 145
% 0.55/0.54 # Positive orientable unit clauses : 27
% 0.55/0.54 # Positive unorientable unit clauses: 5
% 0.55/0.54 # Negative unit clauses : 2
% 0.55/0.54 # Non-unit-clauses : 111
% 0.55/0.54 # Current number of unprocessed clauses: 27
% 0.55/0.54 # ...number of literals in the above : 106
% 0.55/0.54 # Current number of archived formulas : 0
% 0.55/0.54 # Current number of archived clauses : 2
% 0.55/0.54 # Clause-clause subsumption calls (NU) : 1609
% 0.55/0.54 # Rec. Clause-clause subsumption calls : 1214
% 0.55/0.54 # Non-unit clause-clause subsumptions : 68
% 0.55/0.54 # Unit Clause-clause subsumption calls : 5
% 0.55/0.54 # Rewrite failures with RHS unbound : 0
% 0.55/0.54 # BW rewrite match attempts : 39
% 0.55/0.54 # BW rewrite match successes : 26
% 0.55/0.54 # Condensation attempts : 0
% 0.55/0.54 # Condensation successes : 0
% 0.55/0.54 # Termbank termtop insertions : 22341
% 0.55/0.54 # Search garbage collected termcells : 6514
% 0.55/0.54
% 0.55/0.54 # -------------------------------------------------
% 0.55/0.54 # User time : 0.031 s
% 0.55/0.54 # System time : 0.006 s
% 0.55/0.54 # Total time : 0.037 s
% 0.55/0.54 # Maximum resident set size: 3224 pages
% 0.55/0.54
% 0.55/0.54 # -------------------------------------------------
% 0.55/0.54 # User time : 0.037 s
% 0.55/0.54 # System time : 0.010 s
% 0.55/0.54 # Total time : 0.047 s
% 0.55/0.54 # Maximum resident set size: 2176 pages
% 0.55/0.54 % E---3.1 exiting
% 0.55/0.54 % E exiting
%------------------------------------------------------------------------------