TSTP Solution File: KLE006+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE006+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 18:03:47 EDT 2023
% Result : Theorem 272.26s 136.54s
% Output : CNFRefutation 272.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 6 unt; 0 def)
% Number of atoms : 46 ( 23 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 47 ( 19 ~; 16 |; 7 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn; 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0xKAJBWmLJ/E---3.1_22707.p',test_3) ).
fof(test_2,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/export/starexec/sandbox2/tmp/tmp.0xKAJBWmLJ/E---3.1_22707.p',test_2) ).
fof(goals,conjecture,
! [X4] :
( test(X4)
=> one = addition(X4,c(X4)) ),
file('/export/starexec/sandbox2/tmp/tmp.0xKAJBWmLJ/E---3.1_22707.p',goals) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.0xKAJBWmLJ/E---3.1_22707.p',additive_commutativity) ).
fof(c_0_4,plain,
! [X22,X23] :
( ( c(X22) != X23
| complement(X22,X23)
| ~ test(X22) )
& ( ~ complement(X22,X23)
| c(X22) = X23
| ~ test(X22) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])]) ).
fof(c_0_5,plain,
! [X20,X21] :
( ( multiplication(X20,X21) = zero
| ~ complement(X21,X20) )
& ( multiplication(X21,X20) = zero
| ~ complement(X21,X20) )
& ( addition(X20,X21) = one
| ~ complement(X21,X20) )
& ( multiplication(X20,X21) != zero
| multiplication(X21,X20) != zero
| addition(X20,X21) != one
| complement(X21,X20) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])]) ).
cnf(c_0_6,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_7,negated_conjecture,
~ ! [X4] :
( test(X4)
=> one = addition(X4,c(X4)) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_8,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X7,X8] : addition(X7,X8) = addition(X8,X7),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_11,negated_conjecture,
( test(esk1_0)
& one != addition(esk1_0,c(esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_12,plain,
( addition(c(X1),X1) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
one != addition(esk1_0,c(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
test(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : KLE006+1 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.16 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n029.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 2400
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Tue Oct 3 05:03:37 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 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.0xKAJBWmLJ/E---3.1_22707.p
% 272.26/136.54 # Version: 3.1pre001
% 272.26/136.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 272.26/136.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.26/136.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 272.26/136.54 # Starting new_bool_3 with 300s (1) cores
% 272.26/136.54 # Starting new_bool_1 with 300s (1) cores
% 272.26/136.54 # Starting sh5l with 300s (1) cores
% 272.26/136.54 # sh5l with pid 22789 completed with status 0
% 272.26/136.54 # Result found by sh5l
% 272.26/136.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 272.26/136.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.26/136.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 272.26/136.54 # Starting new_bool_3 with 300s (1) cores
% 272.26/136.54 # Starting new_bool_1 with 300s (1) cores
% 272.26/136.54 # Starting sh5l with 300s (1) cores
% 272.26/136.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 272.26/136.54 # Search class: FGUSM-FFSF21-SFFFFFNN
% 272.26/136.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 272.26/136.54 # Starting G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 272.26/136.54 # G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 22790 completed with status 0
% 272.26/136.54 # Result found by G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 272.26/136.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 272.26/136.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.26/136.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 272.26/136.54 # Starting new_bool_3 with 300s (1) cores
% 272.26/136.54 # Starting new_bool_1 with 300s (1) cores
% 272.26/136.54 # Starting sh5l with 300s (1) cores
% 272.26/136.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 272.26/136.54 # Search class: FGUSM-FFSF21-SFFFFFNN
% 272.26/136.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 272.26/136.54 # Starting G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 272.26/136.54 # Preprocessing time : 0.001 s
% 272.26/136.54 # Presaturation interreduction done
% 272.26/136.54
% 272.26/136.54 # Proof found!
% 272.26/136.54 # SZS status Theorem
% 272.26/136.54 # SZS output start CNFRefutation
% See solution above
% 272.26/136.54 # Parsed axioms : 17
% 272.26/136.54 # Removed by relevancy pruning/SinE : 1
% 272.26/136.54 # Initial clauses : 22
% 272.26/136.54 # Removed in clause preprocessing : 0
% 272.26/136.54 # Initial clauses in saturation : 22
% 272.26/136.54 # Processed clauses : 51
% 272.26/136.54 # ...of these trivial : 1
% 272.26/136.54 # ...subsumed : 0
% 272.26/136.54 # ...remaining for further processing : 50
% 272.26/136.54 # Other redundant clauses eliminated : 1
% 272.26/136.54 # Clauses deleted for lack of memory : 0
% 272.26/136.54 # Backward-subsumed : 0
% 272.26/136.54 # Backward-rewritten : 1
% 272.26/136.54 # Generated clauses : 63
% 272.26/136.54 # ...of the previous two non-redundant : 28
% 272.26/136.54 # ...aggressively subsumed : 0
% 272.26/136.54 # Contextual simplify-reflections : 0
% 272.26/136.54 # Paramodulations : 62
% 272.26/136.54 # Factorizations : 0
% 272.26/136.54 # NegExts : 0
% 272.26/136.54 # Equation resolutions : 1
% 272.26/136.54 # Total rewrite steps : 54
% 272.26/136.54 # Propositional unsat checks : 0
% 272.26/136.54 # Propositional check models : 0
% 272.26/136.54 # Propositional check unsatisfiable : 0
% 272.26/136.54 # Propositional clauses : 0
% 272.26/136.54 # Propositional clauses after purity: 0
% 272.26/136.54 # Propositional unsat core size : 0
% 272.26/136.54 # Propositional preprocessing time : 0.000
% 272.26/136.54 # Propositional encoding time : 0.000
% 272.26/136.54 # Propositional solver time : 0.000
% 272.26/136.54 # Success case prop preproc time : 0.000
% 272.26/136.54 # Success case prop encoding time : 0.000
% 272.26/136.54 # Success case prop solver time : 0.000
% 272.26/136.54 # Current number of processed clauses : 26
% 272.26/136.54 # Positive orientable unit clauses : 11
% 272.26/136.54 # Positive unorientable unit clauses: 1
% 272.26/136.54 # Negative unit clauses : 1
% 272.26/136.54 # Non-unit-clauses : 13
% 272.26/136.54 # Current number of unprocessed clauses: 21
% 272.26/136.54 # ...number of literals in the above : 32
% 272.26/136.54 # Current number of archived formulas : 0
% 272.26/136.54 # Current number of archived clauses : 23
% 272.26/136.54 # Clause-clause subsumption calls (NU) : 15
% 272.26/136.54 # Rec. Clause-clause subsumption calls : 15
% 272.26/136.54 # Non-unit clause-clause subsumptions : 0
% 272.26/136.54 # Unit Clause-clause subsumption calls : 1
% 272.26/136.54 # Rewrite failures with RHS unbound : 0
% 272.26/136.54 # BW rewrite match attempts : 29
% 272.26/136.54 # BW rewrite match successes : 24
% 272.26/136.54 # Condensation attempts : 0
% 272.26/136.54 # Condensation successes : 0
% 272.26/136.54 # Termbank termtop insertions : 1431
% 272.26/136.54
% 272.26/136.54 # -------------------------------------------------
% 272.26/136.54 # User time : 0.006 s
% 272.26/136.54 # System time : 0.001 s
% 272.26/136.54 # Total time : 0.006 s
% 272.26/136.54 # Maximum resident set size: 1752 pages
% 272.26/136.54
% 272.26/136.54 # -------------------------------------------------
% 272.26/136.54 # User time : 0.007 s
% 272.26/136.54 # System time : 0.003 s
% 272.26/136.54 # Total time : 0.010 s
% 272.26/136.54 # Maximum resident set size: 1688 pages
% 272.26/136.54 % E---3.1 exiting
% 272.26/136.54 % E---3.1 exiting
%------------------------------------------------------------------------------