TSTP Solution File: GEO457+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO457+1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:32:47 EDT 2023
% Result : Theorem 1018.05s 132.56s
% Output : CNFRefutation 1018.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 16 ( 16 unt; 0 def)
% Number of atoms : 16 ( 15 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 14 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 9 con; 0-2 aty)
% Number of variables : 28 ( 1 sgn; 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(aIMAGEu_LIFTu_DROPu_conjunct1,axiom,
! [X97] : s(fun(real,bool),i(s(fun(fun(real,bool),fun(real,bool)),i(s(fun(fun(real,real),fun(fun(real,bool),fun(real,bool))),image),s(fun(real,real),i(s(fun(fun(real,cart(real,n10)),fun(real,real)),i(s(fun(fun(cart(real,n10),real),fun(fun(real,cart(real,n10)),fun(real,real))),o),s(fun(cart(real,n10),real),drop))),s(fun(real,cart(real,n10)),lift))))),s(fun(real,bool),X97))) = s(fun(real,bool),X97),
file('/export/starexec/sandbox2/tmp/tmp.wUPPHRtwHz/E---3.1_15119.p',aIMAGEu_LIFTu_DROPu_conjunct1) ).
fof(aIMAGEu_o,axiom,
! [X310,X311,X312,X11,X18,X97] : s(fun(X310,bool),i(s(fun(fun(X312,bool),fun(X310,bool)),i(s(fun(fun(X312,X310),fun(fun(X312,bool),fun(X310,bool))),image),s(fun(X312,X310),i(s(fun(fun(X312,X311),fun(X312,X310)),i(s(fun(fun(X311,X310),fun(fun(X312,X311),fun(X312,X310))),o),s(fun(X311,X310),X11))),s(fun(X312,X311),X18))))),s(fun(X312,bool),X97))) = s(fun(X310,bool),i(s(fun(fun(X311,bool),fun(X310,bool)),i(s(fun(fun(X311,X310),fun(fun(X311,bool),fun(X310,bool))),image),s(fun(X311,X310),X11))),s(fun(X311,bool),i(s(fun(fun(X312,bool),fun(X311,bool)),i(s(fun(fun(X312,X311),fun(fun(X312,bool),fun(X311,bool))),image),s(fun(X312,X311),X18))),s(fun(X312,bool),X97))))),
file('/export/starexec/sandbox2/tmp/tmp.wUPPHRtwHz/E---3.1_15119.p',aIMAGEu_o) ).
fof(aUNIONu_UNIVu_conjunct0,axiom,
! [X4,X97] : s(fun(X4,bool),i(s(fun(fun(X4,bool),fun(X4,bool)),i(s(fun(fun(X4,bool),fun(fun(X4,bool),fun(X4,bool))),union),s(fun(X4,bool),univ))),s(fun(X4,bool),X97))) = s(fun(X4,bool),univ),
file('/export/starexec/sandbox2/tmp/tmp.wUPPHRtwHz/E---3.1_15119.p',aUNIONu_UNIVu_conjunct0) ).
fof(aIMAGEu_DROPu_UNIV,conjecture,
s(fun(real,bool),i(s(fun(fun(cart(real,n10),bool),fun(real,bool)),i(s(fun(fun(cart(real,n10),real),fun(fun(cart(real,n10),bool),fun(real,bool))),image),s(fun(cart(real,n10),real),drop))),s(fun(cart(real,n10),bool),univ))) = s(fun(real,bool),univ),
file('/export/starexec/sandbox2/tmp/tmp.wUPPHRtwHz/E---3.1_15119.p',aIMAGEu_DROPu_UNIV) ).
fof(aIMAGEu_LIFTu_UNIV,axiom,
s(fun(cart(real,n10),bool),i(s(fun(fun(real,bool),fun(cart(real,n10),bool)),i(s(fun(fun(real,cart(real,n10)),fun(fun(real,bool),fun(cart(real,n10),bool))),image),s(fun(real,cart(real,n10)),lift))),s(fun(real,bool),univ))) = s(fun(cart(real,n10),bool),univ),
file('/export/starexec/sandbox2/tmp/tmp.wUPPHRtwHz/E---3.1_15119.p',aIMAGEu_LIFTu_UNIV) ).
fof(c_0_5,plain,
! [X2027] : s(fun(real,bool),i(s(fun(fun(real,bool),fun(real,bool)),i(s(fun(fun(real,real),fun(fun(real,bool),fun(real,bool))),image),s(fun(real,real),i(s(fun(fun(real,cart(real,n10)),fun(real,real)),i(s(fun(fun(cart(real,n10),real),fun(fun(real,cart(real,n10)),fun(real,real))),o),s(fun(cart(real,n10),real),drop))),s(fun(real,cart(real,n10)),lift))))),s(fun(real,bool),X2027))) = s(fun(real,bool),X2027),
inference(variable_rename,[status(thm)],[aIMAGEu_LIFTu_DROPu_conjunct1]) ).
fof(c_0_6,plain,
! [X3794,X3795,X3796,X3797,X3798,X3799] : s(fun(X3794,bool),i(s(fun(fun(X3796,bool),fun(X3794,bool)),i(s(fun(fun(X3796,X3794),fun(fun(X3796,bool),fun(X3794,bool))),image),s(fun(X3796,X3794),i(s(fun(fun(X3796,X3795),fun(X3796,X3794)),i(s(fun(fun(X3795,X3794),fun(fun(X3796,X3795),fun(X3796,X3794))),o),s(fun(X3795,X3794),X3797))),s(fun(X3796,X3795),X3798))))),s(fun(X3796,bool),X3799))) = s(fun(X3794,bool),i(s(fun(fun(X3795,bool),fun(X3794,bool)),i(s(fun(fun(X3795,X3794),fun(fun(X3795,bool),fun(X3794,bool))),image),s(fun(X3795,X3794),X3797))),s(fun(X3795,bool),i(s(fun(fun(X3796,bool),fun(X3795,bool)),i(s(fun(fun(X3796,X3795),fun(fun(X3796,bool),fun(X3795,bool))),image),s(fun(X3796,X3795),X3798))),s(fun(X3796,bool),X3799))))),
inference(variable_rename,[status(thm)],[aIMAGEu_o]) ).
cnf(c_0_7,plain,
s(fun(real,bool),i(s(fun(fun(real,bool),fun(real,bool)),i(s(fun(fun(real,real),fun(fun(real,bool),fun(real,bool))),image),s(fun(real,real),i(s(fun(fun(real,cart(real,n10)),fun(real,real)),i(s(fun(fun(cart(real,n10),real),fun(fun(real,cart(real,n10)),fun(real,real))),o),s(fun(cart(real,n10),real),drop))),s(fun(real,cart(real,n10)),lift))))),s(fun(real,bool),X1))) = s(fun(real,bool),X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
s(fun(X1,bool),i(s(fun(fun(X2,bool),fun(X1,bool)),i(s(fun(fun(X2,X1),fun(fun(X2,bool),fun(X1,bool))),image),s(fun(X2,X1),i(s(fun(fun(X2,X3),fun(X2,X1)),i(s(fun(fun(X3,X1),fun(fun(X2,X3),fun(X2,X1))),o),s(fun(X3,X1),X4))),s(fun(X2,X3),X5))))),s(fun(X2,bool),X6))) = s(fun(X1,bool),i(s(fun(fun(X3,bool),fun(X1,bool)),i(s(fun(fun(X3,X1),fun(fun(X3,bool),fun(X1,bool))),image),s(fun(X3,X1),X4))),s(fun(X3,bool),i(s(fun(fun(X2,bool),fun(X3,bool)),i(s(fun(fun(X2,X3),fun(fun(X2,bool),fun(X3,bool))),image),s(fun(X2,X3),X5))),s(fun(X2,bool),X6))))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X5679,X5680] : s(fun(X5679,bool),i(s(fun(fun(X5679,bool),fun(X5679,bool)),i(s(fun(fun(X5679,bool),fun(fun(X5679,bool),fun(X5679,bool))),union),s(fun(X5679,bool),univ))),s(fun(X5679,bool),X5680))) = s(fun(X5679,bool),univ),
inference(variable_rename,[status(thm)],[aUNIONu_UNIVu_conjunct0]) ).
fof(c_0_10,negated_conjecture,
s(fun(real,bool),i(s(fun(fun(cart(real,n10),bool),fun(real,bool)),i(s(fun(fun(cart(real,n10),real),fun(fun(cart(real,n10),bool),fun(real,bool))),image),s(fun(cart(real,n10),real),drop))),s(fun(cart(real,n10),bool),univ))) != s(fun(real,bool),univ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[aIMAGEu_DROPu_UNIV])]) ).
cnf(c_0_11,plain,
s(fun(real,bool),i(s(fun(fun(cart(real,n10),bool),fun(real,bool)),i(s(fun(fun(cart(real,n10),real),fun(fun(cart(real,n10),bool),fun(real,bool))),image),s(fun(cart(real,n10),real),drop))),s(fun(cart(real,n10),bool),i(s(fun(fun(real,bool),fun(cart(real,n10),bool)),i(s(fun(fun(real,cart(real,n10)),fun(fun(real,bool),fun(cart(real,n10),bool))),image),s(fun(real,cart(real,n10)),lift))),s(fun(real,bool),X1))))) = s(fun(real,bool),X1),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
s(fun(X1,bool),i(s(fun(fun(X1,bool),fun(X1,bool)),i(s(fun(fun(X1,bool),fun(fun(X1,bool),fun(X1,bool))),union),s(fun(X1,bool),univ))),s(fun(X1,bool),X2))) = s(fun(X1,bool),univ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
s(fun(cart(real,n10),bool),i(s(fun(fun(real,bool),fun(cart(real,n10),bool)),i(s(fun(fun(real,cart(real,n10)),fun(fun(real,bool),fun(cart(real,n10),bool))),image),s(fun(real,cart(real,n10)),lift))),s(fun(real,bool),univ))) = s(fun(cart(real,n10),bool),univ),
inference(split_conjunct,[status(thm)],[aIMAGEu_LIFTu_UNIV]) ).
cnf(c_0_14,negated_conjecture,
s(fun(real,bool),i(s(fun(fun(cart(real,n10),bool),fun(real,bool)),i(s(fun(fun(cart(real,n10),real),fun(fun(cart(real,n10),bool),fun(real,bool))),image),s(fun(cart(real,n10),real),drop))),s(fun(cart(real,n10),bool),univ))) != s(fun(real,bool),univ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.89/0.97 % Problem : GEO457+1 : TPTP v8.1.2. Released v7.0.0.
% 0.97/0.98 % Command : run_E %s %d THM
% 0.97/1.19 % Computer : n006.cluster.edu
% 0.97/1.19 % Model : x86_64 x86_64
% 0.97/1.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.97/1.19 % Memory : 8042.1875MB
% 0.97/1.19 % OS : Linux 3.10.0-693.el7.x86_64
% 0.97/1.19 % CPULimit : 2400
% 0.97/1.19 % WCLimit : 300
% 0.97/1.19 % DateTime : Tue Oct 3 06:17:11 EDT 2023
% 0.97/1.19 % CPUTime :
% 2.19/2.34 Running first-order theorem proving
% 2.19/2.34 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.wUPPHRtwHz/E---3.1_15119.p
% 1018.05/132.56 # Version: 3.1pre001
% 1018.05/132.56 # Preprocessing class: FMLMSMSLSSSNFFN.
% 1018.05/132.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1018.05/132.56 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 1018.05/132.56 # Starting new_bool_3 with 600s (2) cores
% 1018.05/132.56 # Starting new_bool_1 with 600s (2) cores
% 1018.05/132.56 # Starting sh5l with 300s (1) cores
% 1018.05/132.56 # new_bool_3 with pid 15198 completed with status 0
% 1018.05/132.56 # Result found by new_bool_3
% 1018.05/132.56 # Preprocessing class: FMLMSMSLSSSNFFN.
% 1018.05/132.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1018.05/132.56 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 1018.05/132.56 # Starting new_bool_3 with 600s (2) cores
% 1018.05/132.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1018.05/132.56 # Search class: FGHSM-SMLM33-DFFFFFNN
% 1018.05/132.56 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 1018.05/132.56 # Starting SAT001_MinMin_p005000_rr with 325s (1) cores
% 1018.05/132.56 # Starting new_bool_3 with 61s (1) cores
% 1018.05/132.56 # new_bool_3 with pid 15202 completed with status 7
% 1018.05/132.56 # Starting SAT001_CA_MinMin_p005000_rr with 55s (1) cores
% 1018.05/132.56 # SAT001_CA_MinMin_p005000_rr with pid 15670 completed with status 7
% 1018.05/132.56 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 55s (1) cores
% 1018.05/132.56 # G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 15734 completed with status 0
% 1018.05/132.56 # Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 1018.05/132.56 # Preprocessing class: FMLMSMSLSSSNFFN.
% 1018.05/132.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1018.05/132.56 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 1018.05/132.56 # Starting new_bool_3 with 600s (2) cores
% 1018.05/132.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1018.05/132.56 # Search class: FGHSM-SMLM33-DFFFFFNN
% 1018.05/132.56 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 1018.05/132.56 # Starting SAT001_MinMin_p005000_rr with 325s (1) cores
% 1018.05/132.56 # Starting new_bool_3 with 61s (1) cores
% 1018.05/132.56 # new_bool_3 with pid 15202 completed with status 7
% 1018.05/132.56 # Starting SAT001_CA_MinMin_p005000_rr with 55s (1) cores
% 1018.05/132.56 # SAT001_CA_MinMin_p005000_rr with pid 15670 completed with status 7
% 1018.05/132.56 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 55s (1) cores
% 1018.05/132.56 # Preprocessing time : 0.610 s
% 1018.05/132.56 # Presaturation interreduction done
% 1018.05/132.56
% 1018.05/132.56 # Proof found!
% 1018.05/132.56 # SZS status Theorem
% 1018.05/132.56 # SZS output start CNFRefutation
% See solution above
% 1018.05/132.56 # Parsed axioms : 3257
% 1018.05/132.56 # Removed by relevancy pruning/SinE : 1790
% 1018.05/132.56 # Initial clauses : 3970
% 1018.05/132.56 # Removed in clause preprocessing : 203
% 1018.05/132.56 # Initial clauses in saturation : 3767
% 1018.05/132.56 # Processed clauses : 7310
% 1018.05/132.56 # ...of these trivial : 85
% 1018.05/132.56 # ...subsumed : 3381
% 1018.05/132.56 # ...remaining for further processing : 3844
% 1018.05/132.56 # Other redundant clauses eliminated : 0
% 1018.05/132.56 # Clauses deleted for lack of memory : 0
% 1018.05/132.56 # Backward-subsumed : 15
% 1018.05/132.56 # Backward-rewritten : 191
% 1018.05/132.56 # Generated clauses : 71892
% 1018.05/132.56 # ...of the previous two non-redundant : 33643
% 1018.05/132.56 # ...aggressively subsumed : 0
% 1018.05/132.56 # Contextual simplify-reflections : 206
% 1018.05/132.56 # Paramodulations : 71882
% 1018.05/132.56 # Factorizations : 0
% 1018.05/132.56 # NegExts : 0
% 1018.05/132.56 # Equation resolutions : 10
% 1018.05/132.56 # Total rewrite steps : 61915
% 1018.05/132.56 # Propositional unsat checks : 0
% 1018.05/132.56 # Propositional check models : 0
% 1018.05/132.56 # Propositional check unsatisfiable : 0
% 1018.05/132.56 # Propositional clauses : 0
% 1018.05/132.56 # Propositional clauses after purity: 0
% 1018.05/132.56 # Propositional unsat core size : 0
% 1018.05/132.56 # Propositional preprocessing time : 0.000
% 1018.05/132.56 # Propositional encoding time : 0.000
% 1018.05/132.56 # Propositional solver time : 0.000
% 1018.05/132.56 # Success case prop preproc time : 0.000
% 1018.05/132.56 # Success case prop encoding time : 0.000
% 1018.05/132.56 # Success case prop solver time : 0.000
% 1018.05/132.56 # Current number of processed clauses : 526
% 1018.05/132.56 # Positive orientable unit clauses : 317
% 1018.05/132.56 # Positive unorientable unit clauses: 11
% 1018.05/132.56 # Negative unit clauses : 36
% 1018.05/132.56 # Non-unit-clauses : 162
% 1018.05/132.56 # Current number of unprocessed clauses: 33050
% 1018.05/132.56 # ...number of literals in the above : 79006
% 1018.05/132.56 # Current number of archived formulas : 0
% 1018.05/132.56 # Current number of archived clauses : 3318
% 1018.05/132.56 # Clause-clause subsumption calls (NU) : 4740862
% 1018.05/132.56 # Rec. Clause-clause subsumption calls : 291310
% 1018.05/132.56 # Non-unit clause-clause subsumptions : 1980
% 1018.05/132.56 # Unit Clause-clause subsumption calls : 2418
% 1018.05/132.56 # Rewrite failures with RHS unbound : 661
% 1018.05/132.56 # BW rewrite match attempts : 195527
% 1018.05/132.56 # BW rewrite match successes : 2530
% 1018.05/132.56 # Condensation attempts : 0
% 1018.05/132.56 # Condensation successes : 0
% 1018.05/132.56 # Termbank termtop insertions : 10300750
% 1018.05/132.56
% 1018.05/132.56 # -------------------------------------------------
% 1018.05/132.56 # User time : 127.777 s
% 1018.05/132.56 # System time : 1.145 s
% 1018.05/132.56 # Total time : 128.923 s
% 1018.05/132.56 # Maximum resident set size: 30784 pages
% 1018.05/132.56
% 1018.05/132.56 # -------------------------------------------------
% 1018.05/132.56 # User time : 252.823 s
% 1018.05/132.56 # System time : 2.904 s
% 1018.05/132.56 # Total time : 255.727 s
% 1018.05/132.56 # Maximum resident set size: 11632 pages
% 1018.05/132.56 % E---3.1 exiting
% 1018.05/132.57 % E---3.1 exiting
%------------------------------------------------------------------------------