TSTP Solution File: SYO378^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO378^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:48 EDT 2024
% Result : Theorem 0.17s 0.45s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 18 ( 14 unt; 4 typ; 0 def)
% Number of atoms : 45 ( 33 equ; 0 cnn)
% Maximal formula atoms : 1 ( 3 avg)
% Number of connectives : 37 ( 6 ~; 2 |; 13 &; 16 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 35 ( 35 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 41 ( 21 ^ 5 !; 15 ?; 41 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
c: $i ).
thf(decl_23,type,
cQDP0: $i > $o ).
thf(decl_24,type,
cQDP1: ( $i > $o ) > $o ).
thf(decl_25,type,
cQDP2: ( ( $i > $o ) > $o ) > $o ).
thf(cQDP1_def,axiom,
( cQDP1
= ( ^ [X2: $i > $o] :
( ( X2 = cQDP0 )
& ? [X3: $i] : ( X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cQDP1_def) ).
thf(cQDP0_def,axiom,
( cQDP0
= ( ^ [X1: $i] : ( X1 = c ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cQDP0_def) ).
thf(cQDP2_def,axiom,
( cQDP2
= ( ^ [X4: ( $i > $o ) > $o] :
( ( X4 = cQDP1 )
& ? [X5: $i > $o] : ( X4 @ X5 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cQDP2_def) ).
thf(cQDTHM2,conjecture,
? [X6: ( $i > $o ) > $o] : ( cQDP2 @ X6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cQDTHM2) ).
thf(c_0_4,plain,
( cQDP1
= ( ^ [Z0: $i > $o] :
( ( Z0
= ( ^ [Z1: $i] : ( Z1 = c ) ) )
& ? [X3: $i] : ( Z0 @ X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[cQDP1_def]) ).
thf(c_0_5,plain,
( cQDP0
= ( ^ [Z0: $i] : ( Z0 = c ) ) ),
inference(fof_simplification,[status(thm)],[cQDP0_def]) ).
thf(c_0_6,plain,
( cQDP2
= ( ^ [Z0: ( $i > $o ) > $o] :
( ( Z0
= ( ^ [Z1: $i > $o] :
( ( Z1
= ( ^ [Z2: $i] : ( Z2 = c ) ) )
& ? [X8: $i] : ( Z1 @ X8 ) ) ) )
& ? [X5: $i > $o] : ( Z0 @ X5 ) ) ) ),
inference(fof_simplification,[status(thm)],[cQDP2_def]) ).
thf(c_0_7,plain,
( cQDP1
= ( ^ [Z0: $i > $o] :
( ( Z0
= ( ^ [Z1: $i] : ( Z1 = c ) ) )
& ? [X3: $i] : ( Z0 @ X3 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_8,plain,
( cQDP2
= ( ^ [Z0: ( $i > $o ) > $o] :
( ( Z0
= ( ^ [Z1: $i > $o] :
( ( Z1
= ( ^ [Z2: $i] : ( Z2 = c ) ) )
& ? [X8: $i] : ( Z1 @ X8 ) ) ) )
& ? [X5: $i > $o] : ( Z0 @ X5 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_9,negated_conjecture,
~ ? [X6: ( $i > $o ) > $o] :
( ( X6
= ( ^ [Z0: $i > $o] :
( ( Z0
= ( ^ [Z1: $i] : ( Z1 = c ) ) )
& ? [X9: $i] : ( Z0 @ X9 ) ) ) )
& ? [X10: $i > $o] : ( X6 @ X10 ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cQDTHM2]),c_0_8]) ).
thf(c_0_10,negated_conjecture,
! [X11: ( $i > $o ) > $o,X12: $i > $o] :
( ( X11
!= ( ^ [Z0: $i > $o] :
( ( Z0
= ( ^ [Z1: $i] : ( Z1 = c ) ) )
& ? [X9: $i] : ( Z0 @ X9 ) ) ) )
| ~ ( X11 @ X12 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
thf(c_0_11,negated_conjecture,
! [X4: ( $i > $o ) > $o,X2: $i > $o] :
( ( X4
!= ( ^ [Z0: $i > $o] :
( ( Z0
= ( ^ [Z1: $i] : ( Z1 = c ) ) )
& ? [X16: $i] : ( Z0 @ X16 ) ) ) )
| ~ ( X4 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_12,negated_conjecture,
! [X2: $i > $o] :
~ ( ( X2
= ( ^ [Z0: $i] : ( Z0 = c ) ) )
& ? [X17: $i] : ( X2 @ X17 ) ),
inference(er,[status(thm)],[c_0_11]) ).
thf(c_0_13,negated_conjecture,
$false,
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(er,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_12])])])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SYO378^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n025.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon May 20 10:16:52 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running higher-order theorem proving
% 0.17/0.44 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.17/0.45 # Version: 3.1.0-ho
% 0.17/0.45 # Preprocessing class: HSSSSMSSSLSNHHN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.17/0.45 # Starting sh5l with 300s (1) cores
% 0.17/0.45 # Starting full_lambda_10 with 300s (1) cores
% 0.17/0.45 # Starting full_lambda_6 with 300s (1) cores
% 0.17/0.45 # sh5l with pid 17261 completed with status 0
% 0.17/0.45 # Result found by sh5l
% 0.17/0.45 # Preprocessing class: HSSSSMSSSLSNHHN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.17/0.45 # Starting sh5l with 300s (1) cores
% 0.17/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.45 # Search class: HUHSF-FFSF00-MHHFMMBN
% 0.17/0.45 # partial match(4): HGHSF-FFSF21-SHHFMMBN
% 0.17/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting new_ho_10_cnf2 with 86s (1) cores
% 0.17/0.45 # new_ho_10_cnf2 with pid 17264 completed with status 0
% 0.17/0.45 # Result found by new_ho_10_cnf2
% 0.17/0.45 # Preprocessing class: HSSSSMSSSLSNHHN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.17/0.45 # Starting sh5l with 300s (1) cores
% 0.17/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.45 # Search class: HUHSF-FFSF00-MHHFMMBN
% 0.17/0.45 # partial match(4): HGHSF-FFSF21-SHHFMMBN
% 0.17/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting new_ho_10_cnf2 with 86s (1) cores
% 0.17/0.45 # Preprocessing time : 0.001 s
% 0.17/0.45 # Presaturation interreduction done
% 0.17/0.45
% 0.17/0.45 # Proof found!
% 0.17/0.45 # SZS status Theorem
% 0.17/0.45 # SZS output start CNFRefutation
% See solution above
% 0.17/0.45 # Parsed axioms : 8
% 0.17/0.45 # Removed by relevancy pruning/SinE : 4
% 0.17/0.45 # Initial clauses : 1
% 0.17/0.45 # Removed in clause preprocessing : 0
% 0.17/0.45 # Initial clauses in saturation : 1
% 0.17/0.45 # Processed clauses : 2
% 0.17/0.45 # ...of these trivial : 0
% 0.17/0.45 # ...subsumed : 0
% 0.17/0.45 # ...remaining for further processing : 2
% 0.17/0.45 # Other redundant clauses eliminated : 3
% 0.17/0.45 # Clauses deleted for lack of memory : 0
% 0.17/0.45 # Backward-subsumed : 0
% 0.17/0.45 # Backward-rewritten : 0
% 0.17/0.45 # Generated clauses : 4
% 0.17/0.45 # ...of the previous two non-redundant : 1
% 0.17/0.45 # ...aggressively subsumed : 0
% 0.17/0.45 # Contextual simplify-reflections : 0
% 0.17/0.45 # Paramodulations : 0
% 0.17/0.45 # Factorizations : 0
% 0.17/0.45 # NegExts : 0
% 0.17/0.45 # Equation resolutions : 3
% 0.17/0.45 # Disequality decompositions : 0
% 0.17/0.45 # Total rewrite steps : 0
% 0.17/0.45 # ...of those cached : 0
% 0.17/0.45 # Propositional unsat checks : 0
% 0.17/0.45 # Propositional check models : 0
% 0.17/0.45 # Propositional check unsatisfiable : 0
% 0.17/0.45 # Propositional clauses : 0
% 0.17/0.45 # Propositional clauses after purity: 0
% 0.17/0.45 # Propositional unsat core size : 0
% 0.17/0.45 # Propositional preprocessing time : 0.000
% 0.17/0.45 # Propositional encoding time : 0.000
% 0.17/0.45 # Propositional solver time : 0.000
% 0.17/0.45 # Success case prop preproc time : 0.000
% 0.17/0.45 # Success case prop encoding time : 0.000
% 0.17/0.45 # Success case prop solver time : 0.000
% 0.17/0.45 # Current number of processed clauses : 0
% 0.17/0.45 # Positive orientable unit clauses : 0
% 0.17/0.45 # Positive unorientable unit clauses: 0
% 0.17/0.45 # Negative unit clauses : 0
% 0.17/0.45 # Non-unit-clauses : 0
% 0.17/0.45 # Current number of unprocessed clauses: 0
% 0.17/0.45 # ...number of literals in the above : 0
% 0.17/0.45 # Current number of archived formulas : 0
% 0.17/0.45 # Current number of archived clauses : 1
% 0.17/0.45 # Clause-clause subsumption calls (NU) : 0
% 0.17/0.45 # Rec. Clause-clause subsumption calls : 0
% 0.17/0.45 # Non-unit clause-clause subsumptions : 0
% 0.17/0.45 # Unit Clause-clause subsumption calls : 0
% 0.17/0.45 # Rewrite failures with RHS unbound : 0
% 0.17/0.45 # BW rewrite match attempts : 0
% 0.17/0.45 # BW rewrite match successes : 0
% 0.17/0.45 # Condensation attempts : 2
% 0.17/0.45 # Condensation successes : 0
% 0.17/0.45 # Termbank termtop insertions : 388
% 0.17/0.45 # Search garbage collected termcells : 62
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.003 s
% 0.17/0.45 # System time : 0.000 s
% 0.17/0.45 # Total time : 0.003 s
% 0.17/0.45 # Maximum resident set size: 1772 pages
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.004 s
% 0.17/0.45 # System time : 0.001 s
% 0.17/0.45 # Total time : 0.005 s
% 0.17/0.45 # Maximum resident set size: 1732 pages
% 0.17/0.45 % E---3.1 exiting
% 0.17/0.45 % E exiting
%------------------------------------------------------------------------------