TSTP Solution File: REL001-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : REL001-1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 19:13:21 EDT 2023
% Result : Unsatisfiable 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 36 ( 36 unt; 0 nHn; 6 RR)
% Number of literals : 36 ( 35 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(converse_multiplicativity_10,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox2/tmp/tmp.4CkEr4cywn/E---3.1_19805.p',converse_multiplicativity_10) ).
cnf(composition_identity_6,axiom,
composition(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.4CkEr4cywn/E---3.1_19805.p',composition_identity_6) ).
cnf(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.4CkEr4cywn/E---3.1_19805.p',converse_idempotence_8) ).
cnf(converse_cancellativity_11,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox2/tmp/tmp.4CkEr4cywn/E---3.1_19805.p',converse_cancellativity_11) ).
cnf(maddux1_join_commutativity_1,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.4CkEr4cywn/E---3.1_19805.p',maddux1_join_commutativity_1) ).
cnf(def_zero_13,axiom,
zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox2/tmp/tmp.4CkEr4cywn/E---3.1_19805.p',def_zero_13) ).
cnf(maddux4_definiton_of_meet_4,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox2/tmp/tmp.4CkEr4cywn/E---3.1_19805.p',maddux4_definiton_of_meet_4) ).
cnf(def_top_12,axiom,
top = join(X1,complement(X1)),
file('/export/starexec/sandbox2/tmp/tmp.4CkEr4cywn/E---3.1_19805.p',def_top_12) ).
cnf(maddux3_a_kind_of_de_Morgan_3,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
file('/export/starexec/sandbox2/tmp/tmp.4CkEr4cywn/E---3.1_19805.p',maddux3_a_kind_of_de_Morgan_3) ).
cnf(maddux2_join_associativity_2,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.4CkEr4cywn/E---3.1_19805.p',maddux2_join_associativity_2) ).
cnf(goals_14,negated_conjecture,
join(zero,sk1) != sk1,
file('/export/starexec/sandbox2/tmp/tmp.4CkEr4cywn/E---3.1_19805.p',goals_14) ).
cnf(c_0_11,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
converse_multiplicativity_10 ).
cnf(c_0_12,axiom,
composition(X1,one) = X1,
composition_identity_6 ).
cnf(c_0_13,plain,
composition(converse(one),converse(X1)) = converse(X1),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_15,plain,
composition(converse(one),X1) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
converse_cancellativity_11 ).
cnf(c_0_17,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_18,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_19,axiom,
zero = meet(X1,complement(X1)),
def_zero_13 ).
cnf(c_0_20,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
maddux4_definiton_of_meet_4 ).
cnf(c_0_21,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_23,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,axiom,
top = join(X1,complement(X1)),
def_top_12 ).
cnf(c_0_25,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_18]),c_0_22]) ).
cnf(c_0_26,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
maddux3_a_kind_of_de_Morgan_3 ).
cnf(c_0_28,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
maddux2_join_associativity_2 ).
cnf(c_0_29,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_27,c_0_17]) ).
cnf(c_0_31,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
join(zero,complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_25]),c_0_24]),c_0_26]),c_0_17]) ).
cnf(c_0_33,negated_conjecture,
join(zero,sk1) != sk1,
goals_14 ).
cnf(c_0_34,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : REL001-1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 15:07:14 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/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.4CkEr4cywn/E---3.1_19805.p
% 0.21/0.50 # Version: 3.1pre001
% 0.21/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 19892 completed with status 0
% 0.21/0.50 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.21/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.21/0.50 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.21/0.50 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.21/0.50 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.21/0.50 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.21/0.50 # U----_043_B31_F1_PI_AE_CS_SP_S2S with pid 19904 completed with status 0
% 0.21/0.50 # Result found by U----_043_B31_F1_PI_AE_CS_SP_S2S
% 0.21/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.21/0.50 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.21/0.50 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.21/0.50 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Unsatisfiable
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 14
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 14
% 0.21/0.50 # Removed in clause preprocessing : 1
% 0.21/0.50 # Initial clauses in saturation : 13
% 0.21/0.50 # Processed clauses : 77
% 0.21/0.50 # ...of these trivial : 18
% 0.21/0.50 # ...subsumed : 2
% 0.21/0.50 # ...remaining for further processing : 57
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 0
% 0.21/0.50 # Backward-rewritten : 16
% 0.21/0.50 # Generated clauses : 501
% 0.21/0.50 # ...of the previous two non-redundant : 272
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 501
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Total rewrite steps : 595
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 41
% 0.21/0.50 # Positive orientable unit clauses : 39
% 0.21/0.50 # Positive unorientable unit clauses: 2
% 0.21/0.50 # Negative unit clauses : 0
% 0.21/0.50 # Non-unit-clauses : 0
% 0.21/0.50 # Current number of unprocessed clauses: 201
% 0.21/0.50 # ...number of literals in the above : 201
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 17
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.50 # Non-unit clause-clause subsumptions : 0
% 0.21/0.50 # Unit Clause-clause subsumption calls : 0
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 25
% 0.21/0.50 # BW rewrite match successes : 17
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 4146
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.006 s
% 0.21/0.50 # System time : 0.003 s
% 0.21/0.50 # Total time : 0.009 s
% 0.21/0.50 # Maximum resident set size: 1572 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.029 s
% 0.21/0.50 # System time : 0.014 s
% 0.21/0.50 # Total time : 0.043 s
% 0.21/0.50 # Maximum resident set size: 1688 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------