TSTP Solution File: REL015+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : REL015+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:14:07 EDT 2023
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 54 ( 54 unt; 0 def)
% Number of atoms : 54 ( 53 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 78 ( 3 sgn; 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(converse_multiplicativity,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox/tmp/tmp.Mygx4nBjUd/E---3.1_17990.p',converse_multiplicativity) ).
fof(composition_identity,axiom,
! [X1] : composition(X1,one) = X1,
file('/export/starexec/sandbox/tmp/tmp.Mygx4nBjUd/E---3.1_17990.p',composition_identity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox/tmp/tmp.Mygx4nBjUd/E---3.1_17990.p',converse_idempotence) ).
fof(def_zero,axiom,
! [X1] : zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox/tmp/tmp.Mygx4nBjUd/E---3.1_17990.p',def_zero) ).
fof(maddux4_definiton_of_meet,axiom,
! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox/tmp/tmp.Mygx4nBjUd/E---3.1_17990.p',maddux4_definiton_of_meet) ).
fof(def_top,axiom,
! [X1] : top = join(X1,complement(X1)),
file('/export/starexec/sandbox/tmp/tmp.Mygx4nBjUd/E---3.1_17990.p',def_top) ).
fof(converse_cancellativity,axiom,
! [X1,X2] : join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox/tmp/tmp.Mygx4nBjUd/E---3.1_17990.p',converse_cancellativity) ).
fof(maddux1_join_commutativity,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.Mygx4nBjUd/E---3.1_17990.p',maddux1_join_commutativity) ).
fof(maddux3_a_kind_of_de_Morgan,axiom,
! [X1,X2] : X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
file('/export/starexec/sandbox/tmp/tmp.Mygx4nBjUd/E---3.1_17990.p',maddux3_a_kind_of_de_Morgan) ).
fof(maddux2_join_associativity,axiom,
! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.Mygx4nBjUd/E---3.1_17990.p',maddux2_join_associativity) ).
fof(composition_distributivity,axiom,
! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.Mygx4nBjUd/E---3.1_17990.p',composition_distributivity) ).
fof(goals,conjecture,
composition(top,top) = top,
file('/export/starexec/sandbox/tmp/tmp.Mygx4nBjUd/E---3.1_17990.p',goals) ).
fof(c_0_12,plain,
! [X23,X24] : converse(composition(X23,X24)) = composition(converse(X24),converse(X23)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_13,plain,
! [X16] : composition(X16,one) = X16,
inference(variable_rename,[status(thm)],[composition_identity]) ).
cnf(c_0_14,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
composition(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X20] : converse(converse(X20)) = X20,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
fof(c_0_17,plain,
! [X28] : zero = meet(X28,complement(X28)),
inference(variable_rename,[status(thm)],[def_zero]) ).
fof(c_0_18,plain,
! [X11,X12] : meet(X11,X12) = complement(join(complement(X11),complement(X12))),
inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).
cnf(c_0_19,plain,
composition(converse(one),converse(X1)) = converse(X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
zero = meet(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_23,plain,
! [X27] : top = join(X27,complement(X27)),
inference(variable_rename,[status(thm)],[def_top]) ).
fof(c_0_24,plain,
! [X25,X26] : join(composition(converse(X25),complement(composition(X25,X26))),complement(X26)) = complement(X26),
inference(variable_rename,[status(thm)],[converse_cancellativity]) ).
fof(c_0_25,plain,
! [X4,X5] : join(X4,X5) = join(X5,X4),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
cnf(c_0_26,plain,
composition(converse(one),X1) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
top = join(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_29,plain,
! [X9,X10] : X9 = join(complement(join(complement(X9),complement(X10))),complement(join(complement(X9),X10))),
inference(variable_rename,[status(thm)],[maddux3_a_kind_of_de_Morgan]) ).
cnf(c_0_30,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_15,c_0_26]) ).
fof(c_0_33,plain,
! [X6,X7,X8] : join(X6,join(X7,X8)) = join(join(X6,X7),X8),
inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).
cnf(c_0_34,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_26,c_0_32]) ).
cnf(c_0_38,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_39,plain,
! [X17,X18,X19] : composition(join(X17,X18),X19) = join(composition(X17,X19),composition(X18,X19)),
inference(variable_rename,[status(thm)],[composition_distributivity]) ).
cnf(c_0_40,plain,
join(top,zero) = top,
inference(spm,[status(thm)],[c_0_28,c_0_34]) ).
cnf(c_0_41,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_35,c_0_31]) ).
cnf(c_0_42,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_32]),c_0_37]) ).
cnf(c_0_43,plain,
join(X1,join(complement(X1),X2)) = join(top,X2),
inference(spm,[status(thm)],[c_0_38,c_0_28]) ).
cnf(c_0_44,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_45,plain,
join(top,join(zero,X1)) = join(top,X1),
inference(spm,[status(thm)],[c_0_38,c_0_40]) ).
cnf(c_0_46,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_41,c_0_42]),c_0_28]),c_0_34]),c_0_31]) ).
cnf(c_0_47,plain,
join(top,complement(X1)) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_42]),c_0_28]) ).
cnf(c_0_48,plain,
join(X1,composition(X2,X1)) = composition(join(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_37]),c_0_31]) ).
cnf(c_0_49,plain,
join(top,X1) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
fof(c_0_50,negated_conjecture,
composition(top,top) != top,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goals])]) ).
cnf(c_0_51,plain,
composition(join(X1,one),top) = top,
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
composition(top,top) != top,
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_53,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_49]),c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : REL015+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n013.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 : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 15:06:59 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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/tmp/tmp.Mygx4nBjUd/E---3.1_17990.p
% 0.20/0.51 # Version: 3.1pre001
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 18160 completed with status 0
% 0.20/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.20/0.51 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.51 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.20/0.51 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.20/0.51 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.20/0.51 # U----_043_B31_F1_PI_AE_CS_SP_S2S with pid 18169 completed with status 0
% 0.20/0.51 # Result found by U----_043_B31_F1_PI_AE_CS_SP_S2S
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.20/0.51 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.51 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.20/0.51 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.20/0.51 # Preprocessing time : 0.002 s
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Theorem
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 14
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 14
% 0.20/0.51 # Removed in clause preprocessing : 1
% 0.20/0.51 # Initial clauses in saturation : 13
% 0.20/0.51 # Processed clauses : 41
% 0.20/0.51 # ...of these trivial : 5
% 0.20/0.51 # ...subsumed : 2
% 0.20/0.51 # ...remaining for further processing : 34
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 6
% 0.20/0.51 # Generated clauses : 194
% 0.20/0.51 # ...of the previous two non-redundant : 142
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 194
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Total rewrite steps : 181
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 28
% 0.20/0.51 # Positive orientable unit clauses : 25
% 0.20/0.51 # Positive unorientable unit clauses: 2
% 0.20/0.51 # Negative unit clauses : 1
% 0.20/0.51 # Non-unit-clauses : 0
% 0.20/0.51 # Current number of unprocessed clauses: 108
% 0.20/0.51 # ...number of literals in the above : 108
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 7
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.51 # Non-unit clause-clause subsumptions : 0
% 0.20/0.51 # Unit Clause-clause subsumption calls : 0
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 12
% 0.20/0.51 # BW rewrite match successes : 9
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 2230
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.005 s
% 0.20/0.51 # System time : 0.004 s
% 0.20/0.51 # Total time : 0.009 s
% 0.20/0.51 # Maximum resident set size: 1668 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.026 s
% 0.20/0.51 # System time : 0.014 s
% 0.20/0.51 # Total time : 0.039 s
% 0.20/0.51 # Maximum resident set size: 1680 pages
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------