TSTP Solution File: SYO173^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO173^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:44:50 EDT 2024
% Result : Theorem 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 8 unt; 4 typ; 0 def)
% Number of atoms : 48 ( 0 equ; 0 cnn)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 282 ( 24 ~; 17 |; 12 &; 229 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 10 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 62 ( 0 ^ 60 !; 2 ?; 62 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
nt: $i > $i ).
thf(decl_23,type,
imp: $i > $i > $i ).
thf(decl_24,type,
cT: $i > $o ).
thf(decl_25,type,
esk1_0: $i ).
thf(cLCL077_1,conjecture,
~ ( ! [X1: $i,X2: $i] :
( ~ ( cT @ ( imp @ X1 @ X2 ) )
| ~ ( cT @ X1 )
| ( cT @ X2 ) )
& ! [X1: $i,X2: $i] : ( cT @ ( imp @ X1 @ ( imp @ X2 @ X1 ) ) )
& ! [X1: $i,X2: $i,X3: $i] : ( cT @ ( imp @ ( imp @ X1 @ ( imp @ X2 @ X3 ) ) @ ( imp @ ( imp @ X1 @ X2 ) @ ( imp @ X1 @ X3 ) ) ) )
& ! [X1: $i,X2: $i] : ( cT @ ( imp @ ( imp @ ( nt @ X1 ) @ ( nt @ X2 ) ) @ ( imp @ X2 @ X1 ) ) )
& ? [X4: $i] :
~ ( cT @ ( imp @ ( nt @ ( nt @ X4 ) ) @ X4 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cLCL077_1) ).
thf(c_0_1,negated_conjecture,
~ ~ ( ! [X1: $i,X2: $i] :
( ~ ( cT @ ( imp @ X1 @ X2 ) )
| ~ ( cT @ X1 )
| ( cT @ X2 ) )
& ! [X1: $i,X2: $i] : ( cT @ ( imp @ X1 @ ( imp @ X2 @ X1 ) ) )
& ! [X1: $i,X2: $i,X3: $i] : ( cT @ ( imp @ ( imp @ X1 @ ( imp @ X2 @ X3 ) ) @ ( imp @ ( imp @ X1 @ X2 ) @ ( imp @ X1 @ X3 ) ) ) )
& ! [X1: $i,X2: $i] : ( cT @ ( imp @ ( imp @ ( nt @ X1 ) @ ( nt @ X2 ) ) @ ( imp @ X2 @ X1 ) ) )
& ? [X4: $i] :
~ ( cT @ ( imp @ ( nt @ ( nt @ X4 ) ) @ X4 ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cLCL077_1])]) ).
thf(c_0_2,negated_conjecture,
! [X15: $i,X16: $i,X17: $i,X18: $i,X19: $i,X20: $i,X21: $i,X22: $i,X23: $i] :
( ( ~ ( cT @ ( imp @ X15 @ X16 ) )
| ~ ( cT @ X15 )
| ( cT @ X16 ) )
& ( cT @ ( imp @ X17 @ ( imp @ X18 @ X17 ) ) )
& ( cT @ ( imp @ ( imp @ X19 @ ( imp @ X20 @ X21 ) ) @ ( imp @ ( imp @ X19 @ X20 ) @ ( imp @ X19 @ X21 ) ) ) )
& ( cT @ ( imp @ ( imp @ ( nt @ X22 ) @ ( nt @ X23 ) ) @ ( imp @ X23 @ X22 ) ) )
& ~ ( cT @ ( imp @ ( nt @ ( nt @ esk1_0 ) ) @ esk1_0 ) ) ),
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: $i,X1: $i] :
( ( cT @ X2 )
| ~ ( cT @ ( imp @ X1 @ X2 ) )
| ~ ( cT @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] : ( cT @ ( imp @ ( imp @ X1 @ ( imp @ X2 @ X3 ) ) @ ( imp @ ( imp @ X1 @ X2 ) @ ( imp @ X1 @ X3 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( cT @ ( imp @ ( imp @ X1 @ X2 ) @ ( imp @ X1 @ X3 ) ) )
| ~ ( cT @ ( imp @ X1 @ ( imp @ X2 @ X3 ) ) ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X2: $i,X1: $i] : ( cT @ ( imp @ X1 @ ( imp @ X2 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( cT @ ( imp @ X1 @ X2 ) )
| ~ ( cT @ ( imp @ X1 @ ( imp @ X3 @ X2 ) ) )
| ~ ( cT @ ( imp @ X1 @ X3 ) ) ),
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i,X2: $i] :
( ( cT @ ( imp @ X1 @ X2 ) )
| ~ ( cT @ X2 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( cT @ ( imp @ X1 @ X2 ) )
| ~ ( cT @ ( imp @ X1 @ X3 ) )
| ~ ( cT @ ( imp @ X3 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( cT @ ( imp @ X1 @ X2 ) )
| ~ ( cT @ ( imp @ ( imp @ X3 @ X1 ) @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
thf(c_0_11,negated_conjecture,
! [X2: $i,X1: $i] : ( cT @ ( imp @ ( imp @ ( nt @ X1 ) @ ( nt @ X2 ) ) @ ( imp @ X2 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i,X2: $i] : ( cT @ ( imp @ ( nt @ X1 ) @ ( imp @ X1 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( cT @ ( imp @ ( nt @ X1 ) @ X2 ) )
| ~ ( cT @ ( imp @ ( imp @ X1 @ X3 ) @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
thf(c_0_14,negated_conjecture,
! [X2: $i,X1: $i] : ( cT @ ( imp @ ( nt @ ( nt @ X1 ) ) @ ( imp @ X2 @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i,X2: $i] :
( ( cT @ ( imp @ ( nt @ ( nt @ X1 ) ) @ X1 ) )
| ~ ( cT @ ( imp @ ( nt @ ( nt @ X1 ) ) @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_7,c_0_14]) ).
thf(c_0_16,negated_conjecture,
~ ( cT @ ( imp @ ( nt @ ( nt @ esk1_0 ) ) @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i] : ( cT @ ( imp @ ( nt @ ( nt @ X1 ) ) @ X1 ) ),
inference(spm,[status(thm)],[c_0_15,c_0_6]) ).
thf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO173^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n012.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 10:51:08 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 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.20/0.48 # Version: 3.1.0-ho
% 0.20/0.48 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.48 # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.48 # Starting sh4l with 300s (1) cores
% 0.20/0.48 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.20/0.48 # new_ho_10 with pid 17976 completed with status 0
% 0.20/0.48 # Result found by new_ho_10
% 0.20/0.48 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: HHUNS-FFSF21-MFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.48 # Starting new_ho_10 with 901s (1) cores
% 0.20/0.48 # Starting sh5l with 151s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 151s (1) cores
% 0.20/0.48 # Starting new_bool_2 with 151s (1) cores
% 0.20/0.48 # Starting new_bool_9 with 146s (1) cores
% 0.20/0.48 # sh5l with pid 17983 completed with status 0
% 0.20/0.48 # Result found by sh5l
% 0.20/0.48 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: HHUNS-FFSF21-MFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.48 # Starting new_ho_10 with 901s (1) cores
% 0.20/0.48 # Starting sh5l with 151s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48 # Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Theorem
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 4
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 8
% 0.20/0.49 # Removed in clause preprocessing : 3
% 0.20/0.49 # Initial clauses in saturation : 5
% 0.20/0.49 # Processed clauses : 58
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 18
% 0.20/0.49 # ...remaining for further processing : 40
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 3
% 0.20/0.49 # Generated clauses : 118
% 0.20/0.49 # ...of the previous two non-redundant : 101
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 118
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 12
% 0.20/0.49 # ...of those cached : 5
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 32
% 0.20/0.49 # Positive orientable unit clauses : 8
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 2
% 0.20/0.49 # Non-unit-clauses : 22
% 0.20/0.49 # Current number of unprocessed clauses: 52
% 0.20/0.49 # ...number of literals in the above : 103
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 8
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 134
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 134
% 0.20/0.49 # Non-unit clause-clause subsumptions : 21
% 0.20/0.49 # Unit Clause-clause subsumption calls : 13
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 34
% 0.20/0.49 # BW rewrite match successes : 3
% 0.20/0.49 # Condensation attempts : 58
% 0.20/0.49 # Condensation successes : 3
% 0.20/0.49 # Termbank termtop insertions : 3270
% 0.20/0.49 # Search garbage collected termcells : 97
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.004 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.009 s
% 0.20/0.49 # Maximum resident set size: 1788 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.024 s
% 0.20/0.49 # System time : 0.016 s
% 0.20/0.49 # Total time : 0.040 s
% 0.20/0.49 # Maximum resident set size: 1700 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------