TSTP Solution File: REL024-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : REL024-1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:31:36 EDT 2024
% Result : Unsatisfiable 0.19s 0.54s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 13
% Syntax : Number of clauses : 53 ( 53 unt; 0 nHn; 9 RR)
% Number of literals : 53 ( 52 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 79 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
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(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_idempotence_8) ).
cnf(composition_identity_6,axiom,
composition(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',composition_identity_6) ).
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(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(def_top_12,axiom,
top = join(X1,complement(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',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/sandbox/benchmark/Axioms/REL001-0.ax',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/sandbox/benchmark/Axioms/REL001-0.ax',maddux2_join_associativity_2) ).
cnf(goals_14,negated_conjecture,
join(composition(meet(sk1,converse(sk2)),meet(sk2,sk3)),composition(meet(sk1,converse(sk2)),sk3)) != composition(meet(sk1,converse(sk2)),sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_14) ).
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(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(c_0_13,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
converse_multiplicativity_10 ).
cnf(c_0_14,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_15,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,axiom,
composition(X1,one) = X1,
composition_identity_6 ).
cnf(c_0_17,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_14]) ).
cnf(c_0_18,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
converse_cancellativity_11 ).
cnf(c_0_19,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_20,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,axiom,
zero = meet(X1,complement(X1)),
def_zero_13 ).
cnf(c_0_22,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
maddux4_definiton_of_meet_4 ).
cnf(c_0_23,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_25,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,axiom,
top = join(X1,complement(X1)),
def_top_12 ).
cnf(c_0_27,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_20]),c_0_24]) ).
cnf(c_0_28,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
maddux3_a_kind_of_de_Morgan_3 ).
cnf(c_0_30,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
maddux2_join_associativity_2 ).
cnf(c_0_31,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_29,c_0_19]) ).
cnf(c_0_33,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,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_32,c_0_26]),c_0_27]),c_0_28]),c_0_19]) ).
cnf(c_0_35,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,negated_conjecture,
join(composition(meet(sk1,converse(sk2)),meet(sk2,sk3)),composition(meet(sk1,converse(sk2)),sk3)) != composition(meet(sk1,converse(sk2)),sk3),
inference(fof_simplification,[status(thm)],[goals_14]) ).
cnf(c_0_38,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
join(composition(meet(sk1,converse(sk2)),meet(sk2,sk3)),composition(meet(sk1,converse(sk2)),sk3)) != composition(meet(sk1,converse(sk2)),sk3),
c_0_37 ).
cnf(c_0_40,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
converse_additivity_9 ).
cnf(c_0_41,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
composition_distributivity_7 ).
cnf(c_0_42,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_30,c_0_38]) ).
cnf(c_0_43,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_19,c_0_30]) ).
cnf(c_0_44,negated_conjecture,
join(composition(complement(join(complement(sk1),complement(converse(sk2)))),complement(join(complement(sk2),complement(sk3)))),composition(complement(join(complement(sk1),complement(converse(sk2)))),sk3)) != composition(complement(join(complement(sk1),complement(converse(sk2)))),sk3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_22]),c_0_22]),c_0_22]),c_0_22]) ).
cnf(c_0_45,plain,
converse(join(composition(converse(X1),X2),X3)) = join(composition(converse(X2),X1),converse(X3)),
inference(spm,[status(thm)],[c_0_40,c_0_15]) ).
cnf(c_0_46,plain,
join(composition(X1,converse(X2)),converse(composition(X2,X3))) = composition(join(X1,converse(X3)),converse(X2)),
inference(spm,[status(thm)],[c_0_41,c_0_13]) ).
cnf(c_0_47,plain,
join(X1,complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_32]),c_0_19]) ).
cnf(c_0_48,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_43,c_0_38]) ).
cnf(c_0_49,negated_conjecture,
join(composition(complement(join(complement(sk1),complement(converse(sk2)))),sk3),composition(complement(join(complement(sk1),complement(converse(sk2)))),complement(join(complement(sk2),complement(sk3))))) != composition(complement(join(complement(sk1),complement(converse(sk2)))),sk3),
inference(rw,[status(thm)],[c_0_44,c_0_19]) ).
cnf(c_0_50,plain,
join(composition(X1,X2),composition(X1,X3)) = composition(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_40]),c_0_13]),c_0_14]),c_0_14]),c_0_14]) ).
cnf(c_0_51,plain,
join(X1,complement(join(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50]),c_0_51])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : REL024-1 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 08:20:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.19/0.54 # Version: 3.1.0
% 0.19/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.54 # Starting sh5l with 300s (1) cores
% 0.19/0.54 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 18977 completed with status 0
% 0.19/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.54 # No SInE strategy applied
% 0.19/0.54 # Search class: FUUPM-FFSF21-DFFFFFNN
% 0.19/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.54 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.19/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.54 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.54 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.54 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.54 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 18982 completed with status 0
% 0.19/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.54 # No SInE strategy applied
% 0.19/0.54 # Search class: FUUPM-FFSF21-DFFFFFNN
% 0.19/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.54 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.19/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.54 # Preprocessing time : 0.001 s
% 0.19/0.54 # Presaturation interreduction done
% 0.19/0.54
% 0.19/0.54 # Proof found!
% 0.19/0.54 # SZS status Unsatisfiable
% 0.19/0.54 # SZS output start CNFRefutation
% See solution above
% 0.19/0.54 # Parsed axioms : 14
% 0.19/0.54 # Removed by relevancy pruning/SinE : 0
% 0.19/0.54 # Initial clauses : 14
% 0.19/0.54 # Removed in clause preprocessing : 1
% 0.19/0.54 # Initial clauses in saturation : 13
% 0.19/0.54 # Processed clauses : 416
% 0.19/0.54 # ...of these trivial : 215
% 0.19/0.54 # ...subsumed : 48
% 0.19/0.54 # ...remaining for further processing : 153
% 0.19/0.54 # Other redundant clauses eliminated : 0
% 0.19/0.54 # Clauses deleted for lack of memory : 0
% 0.19/0.54 # Backward-subsumed : 0
% 0.19/0.54 # Backward-rewritten : 38
% 0.19/0.54 # Generated clauses : 4629
% 0.19/0.54 # ...of the previous two non-redundant : 2901
% 0.19/0.54 # ...aggressively subsumed : 0
% 0.19/0.54 # Contextual simplify-reflections : 0
% 0.19/0.54 # Paramodulations : 4629
% 0.19/0.54 # Factorizations : 0
% 0.19/0.54 # NegExts : 0
% 0.19/0.54 # Equation resolutions : 0
% 0.19/0.54 # Disequality decompositions : 0
% 0.19/0.54 # Total rewrite steps : 6880
% 0.19/0.54 # ...of those cached : 5010
% 0.19/0.54 # Propositional unsat checks : 0
% 0.19/0.54 # Propositional check models : 0
% 0.19/0.54 # Propositional check unsatisfiable : 0
% 0.19/0.54 # Propositional clauses : 0
% 0.19/0.54 # Propositional clauses after purity: 0
% 0.19/0.54 # Propositional unsat core size : 0
% 0.19/0.54 # Propositional preprocessing time : 0.000
% 0.19/0.54 # Propositional encoding time : 0.000
% 0.19/0.54 # Propositional solver time : 0.000
% 0.19/0.54 # Success case prop preproc time : 0.000
% 0.19/0.54 # Success case prop encoding time : 0.000
% 0.19/0.54 # Success case prop solver time : 0.000
% 0.19/0.54 # Current number of processed clauses : 102
% 0.19/0.54 # Positive orientable unit clauses : 99
% 0.19/0.54 # Positive unorientable unit clauses: 3
% 0.19/0.54 # Negative unit clauses : 0
% 0.19/0.54 # Non-unit-clauses : 0
% 0.19/0.54 # Current number of unprocessed clauses: 2392
% 0.19/0.54 # ...number of literals in the above : 2392
% 0.19/0.54 # Current number of archived formulas : 0
% 0.19/0.54 # Current number of archived clauses : 52
% 0.19/0.54 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.54 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.54 # Non-unit clause-clause subsumptions : 0
% 0.19/0.54 # Unit Clause-clause subsumption calls : 4
% 0.19/0.54 # Rewrite failures with RHS unbound : 0
% 0.19/0.54 # BW rewrite match attempts : 154
% 0.19/0.54 # BW rewrite match successes : 58
% 0.19/0.54 # Condensation attempts : 0
% 0.19/0.54 # Condensation successes : 0
% 0.19/0.54 # Termbank termtop insertions : 52047
% 0.19/0.54 # Search garbage collected termcells : 2
% 0.19/0.54
% 0.19/0.54 # -------------------------------------------------
% 0.19/0.54 # User time : 0.047 s
% 0.19/0.54 # System time : 0.007 s
% 0.19/0.54 # Total time : 0.054 s
% 0.19/0.54 # Maximum resident set size: 1648 pages
% 0.19/0.54
% 0.19/0.54 # -------------------------------------------------
% 0.19/0.54 # User time : 0.252 s
% 0.19/0.54 # System time : 0.018 s
% 0.19/0.54 # Total time : 0.270 s
% 0.19/0.54 # Maximum resident set size: 1700 pages
% 0.19/0.54 % E---3.1 exiting
% 0.19/0.54 % E exiting
%------------------------------------------------------------------------------