TSTP Solution File: KLE090-10 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE090-10 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:04:55 EDT 2023
% Result : Unsatisfiable 0.33s 0.53s
% Output : CNFRefutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 42 ( 42 unt; 0 nHn; 13 RR)
% Number of literals : 42 ( 41 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 49 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(domain3,axiom,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
file('/export/starexec/sandbox2/tmp/tmp.sy2ymaDo13/E---3.1_27137.p',domain3) ).
cnf(additive_commutativity,axiom,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.sy2ymaDo13/E---3.1_27137.p',additive_commutativity) ).
cnf(multiplicative_right_identity,axiom,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.sy2ymaDo13/E---3.1_27137.p',multiplicative_right_identity) ).
cnf(domain1,axiom,
multiplication(antidomain(X1),X1) = zero,
file('/export/starexec/sandbox2/tmp/tmp.sy2ymaDo13/E---3.1_27137.p',domain1) ).
cnf(right_distributivity,axiom,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.sy2ymaDo13/E---3.1_27137.p',right_distributivity) ).
cnf(additive_identity,axiom,
addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/tmp.sy2ymaDo13/E---3.1_27137.p',additive_identity) ).
cnf(additive_associativity,axiom,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.sy2ymaDo13/E---3.1_27137.p',additive_associativity) ).
cnf(additive_idempotence,axiom,
addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.sy2ymaDo13/E---3.1_27137.p',additive_idempotence) ).
cnf(goals,negated_conjecture,
addition(sK2_goals_X0,sK1_goals_X1) = sK1_goals_X1,
file('/export/starexec/sandbox2/tmp/tmp.sy2ymaDo13/E---3.1_27137.p',goals) ).
cnf(domain2,axiom,
addition(antidomain(multiplication(X1,X2)),antidomain(multiplication(X1,antidomain(antidomain(X2))))) = antidomain(multiplication(X1,antidomain(antidomain(X2)))),
file('/export/starexec/sandbox2/tmp/tmp.sy2ymaDo13/E---3.1_27137.p',domain2) ).
cnf(multiplicative_left_identity,axiom,
multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.sy2ymaDo13/E---3.1_27137.p',multiplicative_left_identity) ).
cnf(left_distributivity,axiom,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.sy2ymaDo13/E---3.1_27137.p',left_distributivity) ).
cnf(goals_1,negated_conjecture,
addition(antidomain(sK1_goals_X1),antidomain(sK2_goals_X0)) != antidomain(sK2_goals_X0),
file('/export/starexec/sandbox2/tmp/tmp.sy2ymaDo13/E---3.1_27137.p',goals_1) ).
cnf(c_0_13,axiom,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
domain3 ).
cnf(c_0_14,axiom,
addition(X1,X2) = addition(X2,X1),
additive_commutativity ).
cnf(c_0_15,axiom,
multiplication(X1,one) = X1,
multiplicative_right_identity ).
cnf(c_0_16,axiom,
multiplication(antidomain(X1),X1) = zero,
domain1 ).
cnf(c_0_17,axiom,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
right_distributivity ).
cnf(c_0_18,plain,
addition(antidomain(X1),antidomain(antidomain(X1))) = one,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
antidomain(one) = zero,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,axiom,
addition(X1,zero) = X1,
additive_identity ).
cnf(c_0_21,axiom,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
additive_associativity ).
cnf(c_0_22,axiom,
addition(X1,X1) = X1,
additive_idempotence ).
cnf(c_0_23,plain,
addition(multiplication(antidomain(addition(X1,X2)),X1),multiplication(antidomain(addition(X1,X2)),X2)) = zero,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
addition(sK2_goals_X0,sK1_goals_X1) = sK1_goals_X1,
goals ).
cnf(c_0_25,plain,
addition(zero,antidomain(zero)) = one,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_27,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,axiom,
addition(antidomain(multiplication(X1,X2)),antidomain(multiplication(X1,antidomain(antidomain(X2))))) = antidomain(multiplication(X1,antidomain(antidomain(X2)))),
domain2 ).
cnf(c_0_29,negated_conjecture,
multiplication(antidomain(sK1_goals_X1),sK2_goals_X0) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_16]),c_0_20]) ).
cnf(c_0_30,plain,
antidomain(zero) = one,
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
addition(one,antidomain(X1)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_18]),c_0_14]) ).
cnf(c_0_32,negated_conjecture,
antidomain(multiplication(antidomain(sK1_goals_X1),antidomain(antidomain(sK2_goals_X0)))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31]) ).
cnf(c_0_33,axiom,
multiplication(one,X1) = X1,
multiplicative_left_identity ).
cnf(c_0_34,axiom,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
left_distributivity ).
cnf(c_0_35,plain,
addition(multiplication(X1,antidomain(X2)),multiplication(X1,antidomain(antidomain(X2)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_15]) ).
cnf(c_0_36,negated_conjecture,
multiplication(antidomain(sK1_goals_X1),antidomain(antidomain(sK2_goals_X0))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_32]),c_0_33]) ).
cnf(c_0_37,negated_conjecture,
addition(antidomain(sK1_goals_X1),antidomain(sK2_goals_X0)) != antidomain(sK2_goals_X0),
goals_1 ).
cnf(c_0_38,plain,
addition(X1,multiplication(antidomain(X2),X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_31]),c_0_33]),c_0_33]) ).
cnf(c_0_39,negated_conjecture,
multiplication(antidomain(sK1_goals_X1),antidomain(sK2_goals_X0)) = antidomain(sK1_goals_X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_20]) ).
cnf(c_0_40,negated_conjecture,
addition(antidomain(sK2_goals_X0),antidomain(sK1_goals_X1)) != antidomain(sK2_goals_X0),
inference(rw,[status(thm)],[c_0_37,c_0_14]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KLE090-10 : TPTP v8.1.2. Released v7.3.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n019.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Oct 3 04:51:36 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 0.21/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.sy2ymaDo13/E---3.1_27137.p
% 0.33/0.53 # Version: 3.1pre001
% 0.33/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.33/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.33/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.33/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.33/0.53 # Starting sh5l with 300s (1) cores
% 0.33/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 27214 completed with status 0
% 0.33/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.33/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.33/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.33/0.53 # No SInE strategy applied
% 0.33/0.53 # Search class: FUUPM-FFSF32-MFFFFFNN
% 0.33/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.33/0.53 # Starting G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y with 811s (1) cores
% 0.33/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.33/0.53 # Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.33/0.53 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.33/0.53 # Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.33/0.53 # G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with pid 27223 completed with status 0
% 0.33/0.53 # Result found by G-E--_208_B02_F1_AE_CS_SP_PS_S0Y
% 0.33/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.33/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.33/0.53 # No SInE strategy applied
% 0.33/0.53 # Search class: FUUPM-FFSF32-MFFFFFNN
% 0.33/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.33/0.53 # Starting G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y with 811s (1) cores
% 0.33/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.33/0.53 # Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.33/0.53 # Preprocessing time : 0.001 s
% 0.33/0.53 # Presaturation interreduction done
% 0.33/0.53
% 0.33/0.53 # Proof found!
% 0.33/0.53 # SZS status Unsatisfiable
% 0.33/0.53 # SZS output start CNFRefutation
% See solution above
% 0.33/0.53 # Parsed axioms : 25
% 0.33/0.53 # Removed by relevancy pruning/SinE : 0
% 0.33/0.53 # Initial clauses : 25
% 0.33/0.53 # Removed in clause preprocessing : 2
% 0.33/0.53 # Initial clauses in saturation : 23
% 0.33/0.53 # Processed clauses : 249
% 0.33/0.53 # ...of these trivial : 83
% 0.33/0.53 # ...subsumed : 20
% 0.33/0.53 # ...remaining for further processing : 146
% 0.33/0.53 # Other redundant clauses eliminated : 0
% 0.33/0.53 # Clauses deleted for lack of memory : 0
% 0.33/0.53 # Backward-subsumed : 0
% 0.33/0.53 # Backward-rewritten : 15
% 0.33/0.53 # Generated clauses : 2497
% 0.33/0.53 # ...of the previous two non-redundant : 1079
% 0.33/0.53 # ...aggressively subsumed : 0
% 0.33/0.53 # Contextual simplify-reflections : 0
% 0.33/0.53 # Paramodulations : 2497
% 0.33/0.53 # Factorizations : 0
% 0.33/0.53 # NegExts : 0
% 0.33/0.53 # Equation resolutions : 0
% 0.33/0.53 # Total rewrite steps : 3812
% 0.33/0.53 # Propositional unsat checks : 0
% 0.33/0.53 # Propositional check models : 0
% 0.33/0.53 # Propositional check unsatisfiable : 0
% 0.33/0.53 # Propositional clauses : 0
% 0.33/0.53 # Propositional clauses after purity: 0
% 0.33/0.53 # Propositional unsat core size : 0
% 0.33/0.53 # Propositional preprocessing time : 0.000
% 0.33/0.53 # Propositional encoding time : 0.000
% 0.33/0.53 # Propositional solver time : 0.000
% 0.33/0.53 # Success case prop preproc time : 0.000
% 0.33/0.53 # Success case prop encoding time : 0.000
% 0.33/0.53 # Success case prop solver time : 0.000
% 0.33/0.53 # Current number of processed clauses : 108
% 0.33/0.53 # Positive orientable unit clauses : 104
% 0.33/0.53 # Positive unorientable unit clauses: 3
% 0.33/0.53 # Negative unit clauses : 1
% 0.33/0.53 # Non-unit-clauses : 0
% 0.33/0.53 # Current number of unprocessed clauses: 837
% 0.33/0.53 # ...number of literals in the above : 837
% 0.33/0.53 # Current number of archived formulas : 0
% 0.33/0.53 # Current number of archived clauses : 40
% 0.33/0.53 # Clause-clause subsumption calls (NU) : 0
% 0.33/0.53 # Rec. Clause-clause subsumption calls : 0
% 0.33/0.53 # Non-unit clause-clause subsumptions : 0
% 0.33/0.53 # Unit Clause-clause subsumption calls : 8
% 0.33/0.53 # Rewrite failures with RHS unbound : 0
% 0.33/0.53 # BW rewrite match attempts : 143
% 0.33/0.53 # BW rewrite match successes : 74
% 0.33/0.53 # Condensation attempts : 0
% 0.33/0.53 # Condensation successes : 0
% 0.33/0.53 # Termbank termtop insertions : 23511
% 0.33/0.53
% 0.33/0.53 # -------------------------------------------------
% 0.33/0.53 # User time : 0.020 s
% 0.33/0.53 # System time : 0.004 s
% 0.33/0.53 # Total time : 0.024 s
% 0.33/0.53 # Maximum resident set size: 1536 pages
% 0.33/0.53
% 0.33/0.53 # -------------------------------------------------
% 0.33/0.53 # User time : 0.098 s
% 0.33/0.53 # System time : 0.022 s
% 0.33/0.53 # Total time : 0.120 s
% 0.33/0.53 # Maximum resident set size: 1684 pages
% 0.33/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------