TSTP Solution File: HAL003+3 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : HAL003+3 : TPTP v8.2.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 Jun 24 07:26:03 EDT 2024
% Result : Theorem 0.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 7 unt; 0 def)
% Number of atoms : 58 ( 7 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 64 ( 27 ~; 25 |; 8 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 38 ( 0 sgn 16 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(properties_for_surjection,axiom,
! [X1,X2,X3] :
( ( morphism(X1,X2,X3)
& ! [X7] :
( element(X7,X3)
=> ? [X8] :
( element(X8,X2)
& apply(X1,X8) = X7 ) ) )
=> surjection(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.SiFs2SI1Wp/E---3.1_30496.p',properties_for_surjection) ).
fof(subtract_in_domain,axiom,
! [X2,X5,X6] :
( ( element(X5,X2)
& element(X6,X2) )
=> element(subtract(X2,X5,X6),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.SiFs2SI1Wp/E---3.1_30496.p',subtract_in_domain) ).
fof(g_surjection,conjecture,
surjection(g),
file('/export/starexec/sandbox2/tmp/tmp.SiFs2SI1Wp/E---3.1_30496.p',g_surjection) ).
fof(lemma12,axiom,
! [X19] :
( element(X19,e)
=> ? [X21,X24] :
( element(X21,b)
& element(X24,b)
& apply(g,subtract(b,X21,X24)) = X19 ) ),
file('/export/starexec/sandbox2/tmp/tmp.SiFs2SI1Wp/E---3.1_30496.p',lemma12) ).
fof(g_morphism,axiom,
morphism(g,b,e),
file('/export/starexec/sandbox2/tmp/tmp.SiFs2SI1Wp/E---3.1_30496.p',g_morphism) ).
fof(c_0_5,plain,
! [X30,X31,X32,X34] :
( ( element(esk2_3(X30,X31,X32),X32)
| ~ morphism(X30,X31,X32)
| surjection(X30) )
& ( ~ element(X34,X31)
| apply(X30,X34) != esk2_3(X30,X31,X32)
| ~ morphism(X30,X31,X32)
| surjection(X30) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[properties_for_surjection])])])])])])]) ).
fof(c_0_6,plain,
! [X99,X100,X101] :
( ~ element(X100,X99)
| ~ element(X101,X99)
| element(subtract(X99,X100,X101),X99) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[subtract_in_domain])])]) ).
fof(c_0_7,negated_conjecture,
~ surjection(g),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[g_surjection])]) ).
cnf(c_0_8,plain,
( surjection(X3)
| ~ element(X1,X2)
| apply(X3,X1) != esk2_3(X3,X2,X4)
| ~ morphism(X3,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( element(subtract(X2,X1,X3),X2)
| ~ element(X1,X2)
| ~ element(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X42] :
( ( element(esk8_1(X42),b)
| ~ element(X42,e) )
& ( element(esk9_1(X42),b)
| ~ element(X42,e) )
& ( apply(g,subtract(b,esk8_1(X42),esk9_1(X42))) = X42
| ~ element(X42,e) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[lemma12])])])])]) ).
fof(c_0_11,negated_conjecture,
~ surjection(g),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( surjection(X1)
| apply(X1,subtract(X2,X3,X4)) != esk2_3(X1,X2,X5)
| ~ element(X4,X2)
| ~ element(X3,X2)
| ~ morphism(X1,X2,X5) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( apply(g,subtract(b,esk8_1(X1),esk9_1(X1))) = X1
| ~ element(X1,e) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
~ surjection(g),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( element(esk8_1(X1),b)
| ~ element(X1,e) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( element(esk9_1(X1),b)
| ~ element(X1,e) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( ~ element(esk2_3(g,b,X1),e)
| ~ morphism(g,b,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),c_0_15]),c_0_16]) ).
cnf(c_0_18,plain,
( element(esk2_3(X1,X2,X3),X3)
| surjection(X1)
| ~ morphism(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,plain,
morphism(g,b,e),
inference(split_conjunct,[status(thm)],[g_morphism]) ).
cnf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : HAL003+3 : TPTP v8.2.0. Released v2.6.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n011.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jun 19 14:38:09 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.49 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.SiFs2SI1Wp/E---3.1_30496.p
% 0.19/0.51 # Version: 3.2.0
% 0.19/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # sh5l with pid 30577 completed with status 0
% 0.19/0.51 # Result found by sh5l
% 0.19/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.51 # Search class: FGUSF-FFMM32-MFFFFFNN
% 0.19/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.51 # SAT001_MinMin_p005000_rr_RG with pid 30584 completed with status 0
% 0.19/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.51 # Search class: FGUSF-FFMM32-MFFFFFNN
% 0.19/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.51 # Preprocessing time : 0.001 s
% 0.19/0.51 # Presaturation interreduction done
% 0.19/0.51
% 0.19/0.51 # Proof found!
% 0.19/0.51 # SZS status Theorem
% 0.19/0.51 # SZS output start CNFRefutation
% See solution above
% 0.19/0.51 # Parsed axioms : 34
% 0.19/0.51 # Removed by relevancy pruning/SinE : 0
% 0.19/0.51 # Initial clauses : 59
% 0.19/0.51 # Removed in clause preprocessing : 0
% 0.19/0.51 # Initial clauses in saturation : 59
% 0.19/0.51 # Processed clauses : 241
% 0.19/0.51 # ...of these trivial : 4
% 0.19/0.51 # ...subsumed : 36
% 0.19/0.51 # ...remaining for further processing : 201
% 0.19/0.51 # Other redundant clauses eliminated : 3
% 0.19/0.51 # Clauses deleted for lack of memory : 0
% 0.19/0.51 # Backward-subsumed : 3
% 0.19/0.51 # Backward-rewritten : 13
% 0.19/0.51 # Generated clauses : 325
% 0.19/0.51 # ...of the previous two non-redundant : 278
% 0.19/0.51 # ...aggressively subsumed : 0
% 0.19/0.51 # Contextual simplify-reflections : 3
% 0.19/0.51 # Paramodulations : 322
% 0.19/0.51 # Factorizations : 0
% 0.19/0.51 # NegExts : 0
% 0.19/0.51 # Equation resolutions : 3
% 0.19/0.51 # Disequality decompositions : 0
% 0.19/0.51 # Total rewrite steps : 89
% 0.19/0.51 # ...of those cached : 75
% 0.19/0.51 # Propositional unsat checks : 0
% 0.19/0.51 # Propositional check models : 0
% 0.19/0.51 # Propositional check unsatisfiable : 0
% 0.19/0.51 # Propositional clauses : 0
% 0.19/0.51 # Propositional clauses after purity: 0
% 0.19/0.51 # Propositional unsat core size : 0
% 0.19/0.51 # Propositional preprocessing time : 0.000
% 0.19/0.51 # Propositional encoding time : 0.000
% 0.19/0.51 # Propositional solver time : 0.000
% 0.19/0.51 # Success case prop preproc time : 0.000
% 0.19/0.51 # Success case prop encoding time : 0.000
% 0.19/0.51 # Success case prop solver time : 0.000
% 0.19/0.51 # Current number of processed clauses : 125
% 0.19/0.51 # Positive orientable unit clauses : 31
% 0.19/0.51 # Positive unorientable unit clauses: 0
% 0.19/0.51 # Negative unit clauses : 1
% 0.19/0.51 # Non-unit-clauses : 93
% 0.19/0.51 # Current number of unprocessed clauses: 121
% 0.19/0.51 # ...number of literals in the above : 544
% 0.19/0.51 # Current number of archived formulas : 0
% 0.19/0.51 # Current number of archived clauses : 74
% 0.19/0.51 # Clause-clause subsumption calls (NU) : 661
% 0.19/0.51 # Rec. Clause-clause subsumption calls : 394
% 0.19/0.51 # Non-unit clause-clause subsumptions : 41
% 0.19/0.51 # Unit Clause-clause subsumption calls : 42
% 0.19/0.51 # Rewrite failures with RHS unbound : 0
% 0.19/0.51 # BW rewrite match attempts : 7
% 0.19/0.51 # BW rewrite match successes : 7
% 0.19/0.51 # Condensation attempts : 0
% 0.19/0.51 # Condensation successes : 0
% 0.19/0.51 # Termbank termtop insertions : 9591
% 0.19/0.51 # Search garbage collected termcells : 978
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.014 s
% 0.19/0.51 # System time : 0.003 s
% 0.19/0.51 # Total time : 0.018 s
% 0.19/0.51 # Maximum resident set size: 2000 pages
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.017 s
% 0.19/0.51 # System time : 0.004 s
% 0.19/0.51 # Total time : 0.020 s
% 0.19/0.51 # Maximum resident set size: 1736 pages
% 0.19/0.51 % E---3.1 exiting
% 0.19/0.51 % E exiting
%------------------------------------------------------------------------------