TSTP Solution File: ITP148^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP148^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:32 EDT 2024
% Result : Theorem 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 14
% Syntax : Number of formulae : 24 ( 14 unt; 10 typ; 0 def)
% Number of atoms : 14 ( 13 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 67 ( 4 ~; 0 |; 0 &; 63 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Number of types : 3 ( 3 usr)
% Number of type conns : 27 ( 27 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 1 con; 0-3 aty)
% Number of variables : 12 ( 0 ^ 12 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
complex: $tType ).
thf(decl_sort2,type,
a: $tType ).
thf(decl_sort3,type,
real: $tType ).
thf(decl_47,type,
comp_a_complex_real: ( a > complex ) > ( real > a ) > real > complex ).
thf(decl_94,type,
path_p769714271omplex: ( real > complex ) > complex ).
thf(decl_96,type,
path_pathfinish_a: ( real > a ) > a ).
thf(decl_97,type,
path_p797330068omplex: ( real > complex ) > complex ).
thf(decl_99,type,
path_pathstart_a: ( real > a ) > a ).
thf(decl_104,type,
poinca1910941596x_of_a: a > complex ).
thf(decl_121,type,
c: real > a ).
thf(conj_0,conjecture,
( ( path_p769714271omplex @ ( comp_a_complex_real @ poinca1910941596x_of_a @ c ) )
= ( path_p797330068omplex @ ( comp_a_complex_real @ poinca1910941596x_of_a @ c ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(fact_13_pathfinish__compose,axiom,
! [X27: a > complex,X28: real > a] :
( ( path_p769714271omplex @ ( comp_a_complex_real @ X27 @ X28 ) )
= ( X27 @ ( path_pathfinish_a @ X28 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_13_pathfinish__compose) ).
thf(fact_0_assms_I2_J,axiom,
( ( path_pathfinish_a @ c )
= ( path_pathstart_a @ c ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_assms_I2_J) ).
thf(fact_18_pathstart__compose,axiom,
! [X35: a > complex,X36: real > a] :
( ( path_p797330068omplex @ ( comp_a_complex_real @ X35 @ X36 ) )
= ( X35 @ ( path_pathstart_a @ X36 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_18_pathstart__compose) ).
thf(c_0_4,negated_conjecture,
( ( path_p769714271omplex @ ( comp_a_complex_real @ poinca1910941596x_of_a @ c ) )
!= ( path_p797330068omplex @ ( comp_a_complex_real @ poinca1910941596x_of_a @ c ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_5,negated_conjecture,
( ( path_p769714271omplex @ ( comp_a_complex_real @ poinca1910941596x_of_a @ c ) )
!= ( path_p797330068omplex @ ( comp_a_complex_real @ poinca1910941596x_of_a @ c ) ) ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
thf(c_0_6,plain,
! [X944: a > complex,X945: real > a] :
( ( path_p769714271omplex @ ( comp_a_complex_real @ X944 @ X945 ) )
= ( X944 @ ( path_pathfinish_a @ X945 ) ) ),
inference(variable_rename,[status(thm)],[fact_13_pathfinish__compose]) ).
thf(c_0_7,negated_conjecture,
( ( path_p769714271omplex @ ( comp_a_complex_real @ poinca1910941596x_of_a @ c ) )
!= ( path_p797330068omplex @ ( comp_a_complex_real @ poinca1910941596x_of_a @ c ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
! [X4: a > complex,X1: real > a] :
( ( path_p769714271omplex @ ( comp_a_complex_real @ X4 @ X1 ) )
= ( X4 @ ( path_pathfinish_a @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
( ( path_pathfinish_a @ c )
= ( path_pathstart_a @ c ) ),
inference(split_conjunct,[status(thm)],[fact_0_assms_I2_J]) ).
thf(c_0_10,plain,
! [X907: a > complex,X908: real > a] :
( ( path_p797330068omplex @ ( comp_a_complex_real @ X907 @ X908 ) )
= ( X907 @ ( path_pathstart_a @ X908 ) ) ),
inference(variable_rename,[status(thm)],[fact_18_pathstart__compose]) ).
thf(c_0_11,negated_conjecture,
( ( path_p797330068omplex @ ( comp_a_complex_real @ poinca1910941596x_of_a @ c ) )
!= ( poinca1910941596x_of_a @ ( path_pathstart_a @ c ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
thf(c_0_12,plain,
! [X4: a > complex,X1: real > a] :
( ( path_p797330068omplex @ ( comp_a_complex_real @ X4 @ X1 ) )
= ( X4 @ ( path_pathstart_a @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : ITP148^1 : TPTP v8.2.0. Released v7.5.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat May 18 18:32:52 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running higher-order theorem proving
% 0.21/0.48 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.21/0.52 # Version: 3.1.0-ho
% 0.21/0.52 # Preprocessing class: HSLMSMSMSSSNHSA.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.21/0.52 # Starting sh7 with 300s (1) cores
% 0.21/0.52 # Starting ho_unfolding_2 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_12 with 300s (1) cores
% 0.21/0.52 # new_bool_12 with pid 15701 completed with status 0
% 0.21/0.52 # Result found by new_bool_12
% 0.21/0.52 # Preprocessing class: HSLMSMSMSSSNHSA.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.21/0.52 # Starting sh7 with 300s (1) cores
% 0.21/0.52 # Starting ho_unfolding_2 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_12 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1,,1,20000,1.0)
% 0.21/0.52 # Search class: HHUSM-FFMS31-SHSFFMNN
% 0.21/0.52 # partial match(5): FHUSM-FFMS21-SFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 163s (1) cores
% 0.21/0.52 # C07_19_nc_SAT001_MinMin_p005000_rr with pid 15702 completed with status 0
% 0.21/0.52 # Result found by C07_19_nc_SAT001_MinMin_p005000_rr
% 0.21/0.52 # Preprocessing class: HSLMSMSMSSSNHSA.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.21/0.52 # Starting sh7 with 300s (1) cores
% 0.21/0.52 # Starting ho_unfolding_2 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_12 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1,,1,20000,1.0)
% 0.21/0.52 # Search class: HHUSM-FFMS31-SHSFFMNN
% 0.21/0.52 # partial match(5): FHUSM-FFMS21-SFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 163s (1) cores
% 0.21/0.52 # Preprocessing time : 0.003 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Theorem
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 466
% 0.21/0.52 # Removed by relevancy pruning/SinE : 443
% 0.21/0.52 # Initial clauses : 24
% 0.21/0.52 # Removed in clause preprocessing : 0
% 0.21/0.52 # Initial clauses in saturation : 24
% 0.21/0.52 # Processed clauses : 15
% 0.21/0.52 # ...of these trivial : 1
% 0.21/0.52 # ...subsumed : 0
% 0.21/0.52 # ...remaining for further processing : 14
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 0
% 0.21/0.52 # Backward-rewritten : 2
% 0.21/0.52 # Generated clauses : 0
% 0.21/0.52 # ...of the previous two non-redundant : 1
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 0
% 0.21/0.52 # Paramodulations : 0
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 4
% 0.21/0.52 # ...of those cached : 0
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 12
% 0.21/0.52 # Positive orientable unit clauses : 9
% 0.21/0.52 # Positive unorientable unit clauses: 2
% 0.21/0.52 # Negative unit clauses : 0
% 0.21/0.52 # Non-unit-clauses : 1
% 0.21/0.52 # Current number of unprocessed clauses: 10
% 0.21/0.52 # ...number of literals in the above : 20
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 2
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.52 # Non-unit clause-clause subsumptions : 0
% 0.21/0.52 # Unit Clause-clause subsumption calls : 0
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 70
% 0.21/0.52 # BW rewrite match successes : 3
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 6361
% 0.21/0.52 # Search garbage collected termcells : 3814
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.006 s
% 0.21/0.52 # System time : 0.005 s
% 0.21/0.52 # Total time : 0.011 s
% 0.21/0.52 # Maximum resident set size: 2972 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.022 s
% 0.21/0.52 # System time : 0.007 s
% 0.21/0.52 # Total time : 0.029 s
% 0.21/0.52 # Maximum resident set size: 2720 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------