TSTP Solution File: HAL003+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : HAL003+3 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.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 : 600s
% DateTime : Sat Jul 16 12:45:11 EDT 2022
% Result : Theorem 0.23s 1.40s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 7 unt; 0 def)
% Number of atoms : 61 ( 8 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 69 ( 30 ~; 27 |; 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 : 40 ( 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/sandbox/benchmark/Axioms/HAL001+0.ax',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/sandbox/benchmark/Axioms/HAL001+0.ax',subtract_in_domain) ).
fof(g_surjection,conjecture,
surjection(g),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',lemma12) ).
fof(g_morphism,axiom,
morphism(g,b,e),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',g_morphism) ).
fof(c_0_5,plain,
! [X9,X10,X11,X13] :
( ( element(esk2_3(X9,X10,X11),X11)
| ~ morphism(X9,X10,X11)
| surjection(X9) )
& ( ~ element(X13,X10)
| apply(X9,X13) != esk2_3(X9,X10,X11)
| ~ morphism(X9,X10,X11)
| surjection(X9) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[properties_for_surjection])])])])])])]) ).
fof(c_0_6,plain,
! [X7,X8,X9] :
( ~ element(X8,X7)
| ~ element(X9,X7)
| element(subtract(X7,X8,X9),X7) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[subtract_in_domain])]) ).
fof(c_0_7,negated_conjecture,
~ surjection(g),
inference(assume_negation,[status(cth)],[g_surjection]) ).
cnf(c_0_8,plain,
( surjection(X1)
| ~ morphism(X1,X2,X3)
| apply(X1,X4) != esk2_3(X1,X2,X3)
| ~ element(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( element(subtract(X1,X2,X3),X1)
| ~ element(X3,X1)
| ~ element(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X25] :
( ( element(esk8_1(X25),b)
| ~ element(X25,e) )
& ( element(esk9_1(X25),b)
| ~ element(X25,e) )
& ( apply(g,subtract(b,esk8_1(X25),esk9_1(X25))) = X25
| ~ element(X25,e) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[lemma12])])])])])]) ).
fof(c_0_11,negated_conjecture,
~ surjection(g),
inference(fof_simplification,[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,
( X1 != esk2_3(g,b,X2)
| ~ element(X1,e)
| ~ morphism(g,b,X2) ),
inference(csr,[status(thm)],[inference(csr,[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(g,b,X1),e)
| ~ morphism(g,b,X1) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_19,plain,
( surjection(X1)
| element(esk2_3(X1,X2,X3),X3)
| ~ morphism(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,plain,
morphism(g,b,e),
inference(split_conjunct,[status(thm)],[g_morphism]) ).
cnf(c_0_21,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : HAL003+3 : TPTP v8.1.0. Released v2.6.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n017.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 : 600
% 0.12/0.33 % DateTime : Tue Jun 7 20:45:47 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.40 # Preprocessing time : 0.019 s
% 0.23/1.40
% 0.23/1.40 # Proof found!
% 0.23/1.40 # SZS status Theorem
% 0.23/1.40 # SZS output start CNFRefutation
% See solution above
% 0.23/1.40 # Proof object total steps : 22
% 0.23/1.40 # Proof object clause steps : 12
% 0.23/1.40 # Proof object formula steps : 10
% 0.23/1.40 # Proof object conjectures : 4
% 0.23/1.40 # Proof object clause conjectures : 1
% 0.23/1.40 # Proof object formula conjectures : 3
% 0.23/1.40 # Proof object initial clauses used : 8
% 0.23/1.40 # Proof object initial formulas used : 5
% 0.23/1.40 # Proof object generating inferences : 4
% 0.23/1.40 # Proof object simplifying inferences : 6
% 0.23/1.40 # Training examples: 0 positive, 0 negative
% 0.23/1.40 # Parsed axioms : 34
% 0.23/1.40 # Removed by relevancy pruning/SinE : 5
% 0.23/1.40 # Initial clauses : 54
% 0.23/1.40 # Removed in clause preprocessing : 0
% 0.23/1.40 # Initial clauses in saturation : 54
% 0.23/1.40 # Processed clauses : 193
% 0.23/1.40 # ...of these trivial : 4
% 0.23/1.40 # ...subsumed : 43
% 0.23/1.40 # ...remaining for further processing : 146
% 0.23/1.40 # Other redundant clauses eliminated : 0
% 0.23/1.40 # Clauses deleted for lack of memory : 0
% 0.23/1.40 # Backward-subsumed : 1
% 0.23/1.40 # Backward-rewritten : 18
% 0.23/1.40 # Generated clauses : 351
% 0.23/1.40 # ...of the previous two non-trivial : 318
% 0.23/1.40 # Contextual simplify-reflections : 14
% 0.23/1.40 # Paramodulations : 349
% 0.23/1.40 # Factorizations : 0
% 0.23/1.40 # Equation resolutions : 2
% 0.23/1.40 # Current number of processed clauses : 127
% 0.23/1.40 # Positive orientable unit clauses : 20
% 0.23/1.40 # Positive unorientable unit clauses: 0
% 0.23/1.40 # Negative unit clauses : 1
% 0.23/1.40 # Non-unit-clauses : 106
% 0.23/1.40 # Current number of unprocessed clauses: 118
% 0.23/1.40 # ...number of literals in the above : 610
% 0.23/1.40 # Current number of archived formulas : 0
% 0.23/1.40 # Current number of archived clauses : 19
% 0.23/1.40 # Clause-clause subsumption calls (NU) : 1152
% 0.23/1.40 # Rec. Clause-clause subsumption calls : 419
% 0.23/1.40 # Non-unit clause-clause subsumptions : 58
% 0.23/1.40 # Unit Clause-clause subsumption calls : 0
% 0.23/1.40 # Rewrite failures with RHS unbound : 0
% 0.23/1.40 # BW rewrite match attempts : 6
% 0.23/1.40 # BW rewrite match successes : 6
% 0.23/1.40 # Condensation attempts : 0
% 0.23/1.40 # Condensation successes : 0
% 0.23/1.40 # Termbank termtop insertions : 10439
% 0.23/1.40
% 0.23/1.40 # -------------------------------------------------
% 0.23/1.40 # User time : 0.034 s
% 0.23/1.40 # System time : 0.002 s
% 0.23/1.40 # Total time : 0.036 s
% 0.23/1.40 # Maximum resident set size: 3652 pages
% 0.23/23.46 eprover: CPU time limit exceeded, terminating
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.50 eprover: No such file or directory
% 0.23/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.50 eprover: No such file or directory
% 0.23/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.51 eprover: No such file or directory
% 0.23/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.52 eprover: No such file or directory
% 0.23/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.52 eprover: No such file or directory
%------------------------------------------------------------------------------