TSTP Solution File: REL013-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : REL013-1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : Tue May 21 02:32:07 EDT 2024
% Result : Unsatisfiable 272.42s 136.61s
% Output : CNFRefutation 272.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of clauses : 52 ( 49 unt; 0 nHn; 9 RR)
% Number of literals : 55 ( 54 equ; 6 neg)
% Maximal clause size : 2 ( 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; 2 con; 0-2 aty)
% Number of variables : 80 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/benchmark/Axioms/REL001-0.ax',maddux3_a_kind_of_de_Morgan_3) ).
cnf(maddux1_join_commutativity_1,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux1_join_commutativity_1) ).
cnf(def_zero_13,axiom,
zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',def_zero_13) ).
cnf(maddux4_definiton_of_meet_4,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux4_definiton_of_meet_4) ).
cnf(maddux2_join_associativity_2,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux2_join_associativity_2) ).
cnf(converse_multiplicativity_10,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_multiplicativity_10) ).
cnf(composition_distributivity_7,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',composition_distributivity_7) ).
cnf(converse_additivity_9,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_additivity_9) ).
cnf(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_idempotence_8) ).
cnf(converse_cancellativity_11,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_cancellativity_11) ).
cnf(goals_14,negated_conjecture,
( composition(sk1,zero) != zero
| composition(zero,sk1) != zero ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_14) ).
cnf(c_0_11,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
maddux3_a_kind_of_de_Morgan_3 ).
cnf(c_0_12,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_13,axiom,
zero = meet(X1,complement(X1)),
def_zero_13 ).
cnf(c_0_14,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
maddux4_definiton_of_meet_4 ).
cnf(c_0_15,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
complement(join(complement(X1),complement(complement(X1)))) = zero,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
join(zero,complement(join(complement(X1),complement(X1)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_12]) ).
cnf(c_0_18,plain,
complement(join(zero,complement(zero))) = zero,
inference(spm,[status(thm)],[c_0_16,c_0_16]) ).
cnf(c_0_19,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
maddux2_join_associativity_2 ).
cnf(c_0_20,plain,
join(zero,complement(join(zero,zero))) = join(zero,complement(zero)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_12]),c_0_19]) ).
cnf(c_0_22,plain,
join(zero,join(complement(join(zero,zero)),X1)) = join(zero,join(complement(zero),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_19]) ).
cnf(c_0_23,plain,
join(zero,join(X1,complement(join(complement(X2),complement(X2))))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_21,c_0_17]) ).
cnf(c_0_24,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
converse_multiplicativity_10 ).
cnf(c_0_25,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
composition_distributivity_7 ).
cnf(c_0_26,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
converse_additivity_9 ).
cnf(c_0_27,plain,
join(complement(join(zero,zero)),X1) = join(complement(zero),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_23]) ).
cnf(c_0_28,plain,
composition(converse(X1),join(converse(X2),converse(X3))) = join(composition(converse(X1),converse(X2)),composition(converse(X1),converse(X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_24]),c_0_24]),c_0_26]) ).
cnf(c_0_29,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_30,plain,
join(zero,zero) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_27]),c_0_27]),c_0_15]) ).
cnf(c_0_31,plain,
composition(X1,join(converse(X2),converse(X3))) = join(composition(X1,converse(X2)),composition(X1,converse(X3))),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_19,c_0_30]) ).
cnf(c_0_33,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
converse_cancellativity_11 ).
cnf(c_0_34,plain,
composition(X1,join(converse(X2),X3)) = join(composition(X1,converse(X2)),composition(X1,X3)),
inference(spm,[status(thm)],[c_0_31,c_0_29]) ).
cnf(c_0_35,plain,
join(zero,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_32]),c_0_17]) ).
cnf(c_0_36,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_33,c_0_12]) ).
cnf(c_0_37,plain,
composition(X1,join(X2,X3)) = join(composition(X1,X2),composition(X1,X3)),
inference(spm,[status(thm)],[c_0_34,c_0_29]) ).
cnf(c_0_38,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_35]) ).
cnf(c_0_39,plain,
join(complement(X1),join(composition(converse(X2),complement(composition(X2,X1))),X3)) = join(complement(X1),X3),
inference(spm,[status(thm)],[c_0_19,c_0_36]) ).
cnf(c_0_40,plain,
join(composition(X1,X2),composition(X1,zero)) = composition(X1,X2),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
join(converse(zero),converse(X1)) = converse(X1),
inference(spm,[status(thm)],[c_0_26,c_0_35]) ).
cnf(c_0_42,plain,
join(complement(X1),composition(converse(X2),zero)) = complement(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_36]) ).
cnf(c_0_43,plain,
complement(complement(zero)) = zero,
inference(rw,[status(thm)],[c_0_18,c_0_35]) ).
cnf(c_0_44,plain,
join(converse(zero),X1) = X1,
inference(spm,[status(thm)],[c_0_41,c_0_29]) ).
cnf(c_0_45,negated_conjecture,
( composition(sk1,zero) != zero
| composition(zero,sk1) != zero ),
inference(fof_simplification,[status(thm)],[goals_14]) ).
cnf(c_0_46,plain,
composition(converse(X1),zero) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_35]) ).
cnf(c_0_47,plain,
converse(zero) = zero,
inference(spm,[status(thm)],[c_0_38,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
( composition(sk1,zero) != zero
| composition(zero,sk1) != zero ),
c_0_45 ).
cnf(c_0_49,plain,
composition(zero,X1) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_46]),c_0_47]),c_0_47]),c_0_29]) ).
cnf(c_0_50,plain,
composition(X1,zero) = zero,
inference(spm,[status(thm)],[c_0_46,c_0_29]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]),c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : REL013-1 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 08:27:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.50 Running first-order model finding
% 0.22/0.50 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 272.42/136.61 # Version: 3.1.0
% 272.42/136.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 272.42/136.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.42/136.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 272.42/136.61 # Starting new_bool_3 with 300s (1) cores
% 272.42/136.61 # Starting new_bool_1 with 300s (1) cores
% 272.42/136.61 # Starting sh5l with 300s (1) cores
% 272.42/136.61 # new_bool_1 with pid 19052 completed with status 0
% 272.42/136.61 # Result found by new_bool_1
% 272.42/136.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 272.42/136.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.42/136.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 272.42/136.61 # Starting new_bool_3 with 300s (1) cores
% 272.42/136.61 # Starting new_bool_1 with 300s (1) cores
% 272.42/136.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 272.42/136.61 # Search class: FUHPM-FFSF21-MFFFFFNN
% 272.42/136.61 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 272.42/136.61 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 181s (1) cores
% 272.42/136.61 # H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with pid 19057 completed with status 0
% 272.42/136.61 # Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S2S
% 272.42/136.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 272.42/136.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.42/136.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 272.42/136.61 # Starting new_bool_3 with 300s (1) cores
% 272.42/136.61 # Starting new_bool_1 with 300s (1) cores
% 272.42/136.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 272.42/136.61 # Search class: FUHPM-FFSF21-MFFFFFNN
% 272.42/136.61 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 272.42/136.61 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 181s (1) cores
% 272.42/136.61 # Preprocessing time : 0.001 s
% 272.42/136.61
% 272.42/136.61 # Proof found!
% 272.42/136.61 # SZS status Unsatisfiable
% 272.42/136.61 # SZS output start CNFRefutation
% See solution above
% 272.42/136.61 # Parsed axioms : 14
% 272.42/136.61 # Removed by relevancy pruning/SinE : 2
% 272.42/136.61 # Initial clauses : 12
% 272.42/136.61 # Removed in clause preprocessing : 0
% 272.42/136.61 # Initial clauses in saturation : 12
% 272.42/136.61 # Processed clauses : 177
% 272.42/136.61 # ...of these trivial : 28
% 272.42/136.61 # ...subsumed : 81
% 272.42/136.61 # ...remaining for further processing : 67
% 272.42/136.61 # Other redundant clauses eliminated : 0
% 272.42/136.61 # Clauses deleted for lack of memory : 0
% 272.42/136.61 # Backward-subsumed : 0
% 272.42/136.61 # Backward-rewritten : 36
% 272.42/136.61 # Generated clauses : 1126
% 272.42/136.61 # ...of the previous two non-redundant : 957
% 272.42/136.61 # ...aggressively subsumed : 0
% 272.42/136.61 # Contextual simplify-reflections : 0
% 272.42/136.61 # Paramodulations : 1126
% 272.42/136.61 # Factorizations : 0
% 272.42/136.61 # NegExts : 0
% 272.42/136.61 # Equation resolutions : 0
% 272.42/136.61 # Disequality decompositions : 0
% 272.42/136.61 # Total rewrite steps : 1183
% 272.42/136.61 # ...of those cached : 678
% 272.42/136.61 # Propositional unsat checks : 0
% 272.42/136.61 # Propositional check models : 0
% 272.42/136.61 # Propositional check unsatisfiable : 0
% 272.42/136.61 # Propositional clauses : 0
% 272.42/136.61 # Propositional clauses after purity: 0
% 272.42/136.61 # Propositional unsat core size : 0
% 272.42/136.61 # Propositional preprocessing time : 0.000
% 272.42/136.61 # Propositional encoding time : 0.000
% 272.42/136.61 # Propositional solver time : 0.000
% 272.42/136.61 # Success case prop preproc time : 0.000
% 272.42/136.61 # Success case prop encoding time : 0.000
% 272.42/136.61 # Success case prop solver time : 0.000
% 272.42/136.61 # Current number of processed clauses : 31
% 272.42/136.61 # Positive orientable unit clauses : 25
% 272.42/136.61 # Positive unorientable unit clauses: 6
% 272.42/136.61 # Negative unit clauses : 0
% 272.42/136.61 # Non-unit-clauses : 0
% 272.42/136.61 # Current number of unprocessed clauses: 743
% 272.42/136.61 # ...number of literals in the above : 743
% 272.42/136.61 # Current number of archived formulas : 0
% 272.42/136.61 # Current number of archived clauses : 36
% 272.42/136.61 # Clause-clause subsumption calls (NU) : 0
% 272.42/136.61 # Rec. Clause-clause subsumption calls : 0
% 272.42/136.61 # Non-unit clause-clause subsumptions : 0
% 272.42/136.61 # Unit Clause-clause subsumption calls : 10
% 272.42/136.61 # Rewrite failures with RHS unbound : 19
% 272.42/136.61 # BW rewrite match attempts : 102
% 272.42/136.61 # BW rewrite match successes : 52
% 272.42/136.61 # Condensation attempts : 0
% 272.42/136.61 # Condensation successes : 0
% 272.42/136.61 # Termbank termtop insertions : 12633
% 272.42/136.61 # Search garbage collected termcells : 11
% 272.42/136.61
% 272.42/136.61 # -------------------------------------------------
% 272.42/136.61 # User time : 0.014 s
% 272.42/136.61 # System time : 0.002 s
% 272.42/136.61 # Total time : 0.016 s
% 272.42/136.61 # Maximum resident set size: 1672 pages
% 272.42/136.61
% 272.42/136.61 # -------------------------------------------------
% 272.42/136.61 # User time : 0.014 s
% 272.42/136.61 # System time : 0.005 s
% 272.42/136.61 # Total time : 0.019 s
% 272.42/136.61 # Maximum resident set size: 1712 pages
% 272.42/136.61 % E---3.1 exiting
%------------------------------------------------------------------------------