TSTP Solution File: NUM670^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM670^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 01:15:27 EDT 2024
% Result : Theorem 0.19s 0.47s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 24 ( 18 unt; 6 typ; 0 def)
% Number of atoms : 18 ( 17 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 99 ( 13 ~; 0 |; 0 &; 86 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 24 ( 0 ^ 24 !; 0 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_22,type,
x: nat ).
thf(decl_23,type,
y: nat ).
thf(decl_24,type,
z: nat ).
thf(decl_25,type,
pl: nat > nat > nat ).
thf(decl_26,type,
esk1_0: nat ).
thf(satz19a,conjecture,
~ ! [X1: nat] :
( ( pl @ x @ z )
!= ( pl @ ( pl @ y @ z ) @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz19a) ).
thf(satz5,axiom,
! [X3: nat,X4: nat,X5: nat] :
( ( pl @ ( pl @ X3 @ X4 ) @ X5 )
= ( pl @ X3 @ ( pl @ X4 @ X5 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz5) ).
thf(m,axiom,
~ ! [X1: nat] :
( x
!= ( pl @ y @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
thf(satz6,axiom,
! [X3: nat,X4: nat] :
( ( pl @ X3 @ X4 )
= ( pl @ X4 @ X3 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz6) ).
thf(c_0_4,negated_conjecture,
~ ~ ! [X1: nat] :
( ( pl @ x @ z )
!= ( pl @ ( pl @ y @ z ) @ X1 ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz19a])]) ).
thf(c_0_5,negated_conjecture,
! [X20: nat] :
( ( pl @ x @ z )
!= ( pl @ ( pl @ y @ z ) @ X20 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
thf(c_0_6,plain,
! [X17: nat,X18: nat,X19: nat] :
( ( pl @ ( pl @ X17 @ X18 ) @ X19 )
= ( pl @ X17 @ ( pl @ X18 @ X19 ) ) ),
inference(variable_rename,[status(thm)],[satz5]) ).
thf(c_0_7,plain,
~ ! [X1: nat] :
( x
!= ( pl @ y @ X1 ) ),
inference(fof_simplification,[status(thm)],[m]) ).
thf(c_0_8,negated_conjecture,
! [X1: nat] :
( ( pl @ x @ z )
!= ( pl @ ( pl @ y @ z ) @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,plain,
! [X1: nat,X3: nat,X4: nat] :
( ( pl @ ( pl @ X1 @ X3 ) @ X4 )
= ( pl @ X1 @ ( pl @ X3 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
! [X15: nat,X16: nat] :
( ( pl @ X15 @ X16 )
= ( pl @ X16 @ X15 ) ),
inference(variable_rename,[status(thm)],[satz6]) ).
thf(c_0_11,plain,
( x
= ( pl @ y @ esk1_0 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
thf(c_0_12,negated_conjecture,
! [X1: nat] :
( ( pl @ y @ ( pl @ z @ X1 ) )
!= ( pl @ x @ z ) ),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_13,plain,
! [X3: nat,X1: nat] :
( ( pl @ X1 @ X3 )
= ( pl @ X3 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_14,plain,
( x
= ( pl @ y @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_15,negated_conjecture,
! [X1: nat] :
( ( pl @ y @ ( pl @ X1 @ z ) )
!= ( pl @ x @ z ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_16,plain,
! [X1: nat] :
( ( pl @ y @ ( pl @ esk1_0 @ X1 ) )
= ( pl @ x @ X1 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
thf(c_0_17,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_15,c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM670^1 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n021.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 : Mon May 20 05:58: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: HSSSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.47 # Starting ho_unfolding_6 with 300s (1) cores
% 0.19/0.47 # Starting sh4l with 300s (1) cores
% 0.19/0.47 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.19/0.47 # ho_unfolding_6 with pid 15540 completed with status 0
% 0.19/0.47 # Result found by ho_unfolding_6
% 0.19/0.47 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.47 # Starting ho_unfolding_6 with 300s (1) cores
% 0.19/0.47 # No SInE strategy applied
% 0.19/0.47 # Search class: HUUPS-FFSF22-SFFFFFNN
% 0.19/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.47 # new_ho_10 with pid 15544 completed with status 0
% 0.19/0.47 # Result found by new_ho_10
% 0.19/0.47 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.47 # Starting ho_unfolding_6 with 300s (1) cores
% 0.19/0.47 # No SInE strategy applied
% 0.19/0.47 # Search class: HUUPS-FFSF22-SFFFFFNN
% 0.19/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47 # Starting new_ho_10 with 163s (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 : 10
% 0.19/0.47 # Removed by relevancy pruning/SinE : 0
% 0.19/0.47 # Initial clauses : 10
% 0.19/0.47 # Removed in clause preprocessing : 6
% 0.19/0.47 # Initial clauses in saturation : 4
% 0.19/0.47 # Processed clauses : 11
% 0.19/0.47 # ...of these trivial : 0
% 0.19/0.47 # ...subsumed : 0
% 0.19/0.47 # ...remaining for further processing : 11
% 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 : 1
% 0.19/0.47 # Generated clauses : 15
% 0.19/0.47 # ...of the previous two non-redundant : 13
% 0.19/0.47 # ...aggressively subsumed : 0
% 0.19/0.47 # Contextual simplify-reflections : 0
% 0.19/0.47 # Paramodulations : 15
% 0.19/0.47 # Factorizations : 0
% 0.19/0.47 # NegExts : 0
% 0.19/0.47 # Equation resolutions : 0
% 0.19/0.47 # Disequality decompositions : 0
% 0.19/0.47 # Total rewrite steps : 9
% 0.19/0.47 # ...of those cached : 1
% 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 : 3
% 0.19/0.47 # Positive unorientable unit clauses: 1
% 0.19/0.47 # Negative unit clauses : 2
% 0.19/0.47 # Non-unit-clauses : 0
% 0.19/0.47 # Current number of unprocessed clauses: 7
% 0.19/0.47 # ...number of literals in the above : 7
% 0.19/0.47 # Current number of archived formulas : 0
% 0.19/0.47 # Current number of archived clauses : 5
% 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 : 17
% 0.19/0.47 # BW rewrite match successes : 17
% 0.19/0.47 # Condensation attempts : 11
% 0.19/0.47 # Condensation successes : 0
% 0.19/0.47 # Termbank termtop insertions : 500
% 0.19/0.47 # Search garbage collected termcells : 50
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.003 s
% 0.19/0.47 # System time : 0.002 s
% 0.19/0.47 # Total time : 0.005 s
% 0.19/0.47 # Maximum resident set size: 1596 pages
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.003 s
% 0.19/0.47 # System time : 0.005 s
% 0.19/0.47 # Total time : 0.008 s
% 0.19/0.47 # Maximum resident set size: 1716 pages
% 0.19/0.47 % E---3.1 exiting
% 0.19/0.47 % E exiting
%------------------------------------------------------------------------------