TSTP Solution File: REL031-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : REL031-2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:24 EDT 2023
% Result : Unsatisfiable 1.24s 0.71s
% Output : CNFRefutation 1.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 35 ( 35 unt; 0 nHn; 11 RR)
% Number of literals : 35 ( 34 equ; 3 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(converse_multiplicativity_10,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox/tmp/tmp.pUfj0DQUgj/E---3.1_10122.p',converse_multiplicativity_10) ).
cnf(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox/tmp/tmp.pUfj0DQUgj/E---3.1_10122.p',converse_idempotence_8) ).
cnf(composition_identity_6,axiom,
composition(X1,one) = X1,
file('/export/starexec/sandbox/tmp/tmp.pUfj0DQUgj/E---3.1_10122.p',composition_identity_6) ).
cnf(goals_18,negated_conjecture,
join(composition(converse(sk2),sk2),one) = one,
file('/export/starexec/sandbox/tmp/tmp.pUfj0DQUgj/E---3.1_10122.p',goals_18) ).
cnf(maddux1_join_commutativity_1,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.pUfj0DQUgj/E---3.1_10122.p',maddux1_join_commutativity_1) ).
cnf(maddux2_join_associativity_2,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.pUfj0DQUgj/E---3.1_10122.p',maddux2_join_associativity_2) ).
cnf(composition_distributivity_7,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.pUfj0DQUgj/E---3.1_10122.p',composition_distributivity_7) ).
cnf(goals_17,negated_conjecture,
join(composition(converse(sk1),sk1),one) = one,
file('/export/starexec/sandbox/tmp/tmp.pUfj0DQUgj/E---3.1_10122.p',goals_17) ).
cnf(converse_additivity_9,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox/tmp/tmp.pUfj0DQUgj/E---3.1_10122.p',converse_additivity_9) ).
cnf(composition_associativity_5,axiom,
composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.pUfj0DQUgj/E---3.1_10122.p',composition_associativity_5) ).
cnf(goals_19,negated_conjecture,
join(composition(converse(composition(sk1,sk2)),composition(sk1,sk2)),one) != one,
file('/export/starexec/sandbox/tmp/tmp.pUfj0DQUgj/E---3.1_10122.p',goals_19) ).
cnf(c_0_11,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
converse_multiplicativity_10 ).
cnf(c_0_12,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_13,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,axiom,
composition(X1,one) = X1,
composition_identity_6 ).
cnf(c_0_15,negated_conjecture,
join(composition(converse(sk2),sk2),one) = one,
goals_18 ).
cnf(c_0_16,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_17,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12]) ).
cnf(c_0_18,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
maddux2_join_associativity_2 ).
cnf(c_0_19,negated_conjecture,
join(one,composition(converse(sk2),sk2)) = one,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
join(one,join(composition(converse(sk2),sk2),X1)) = join(one,X1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
composition_distributivity_7 ).
cnf(c_0_23,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
join(composition(converse(sk1),sk1),one) = one,
goals_17 ).
cnf(c_0_25,negated_conjecture,
join(one,composition(join(converse(sk2),X1),sk2)) = join(one,composition(X1,sk2)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
converse_additivity_9 ).
cnf(c_0_27,plain,
join(X1,composition(X2,X1)) = composition(join(one,X2),X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
join(one,composition(converse(sk1),sk1)) = one,
inference(rw,[status(thm)],[c_0_24,c_0_16]) ).
cnf(c_0_29,axiom,
composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
composition_associativity_5 ).
cnf(c_0_30,negated_conjecture,
join(composition(converse(composition(sk1,sk2)),composition(sk1,sk2)),one) != one,
goals_19 ).
cnf(c_0_31,negated_conjecture,
join(one,composition(converse(join(sk2,X1)),sk2)) = join(one,composition(converse(X1),sk2)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
join(X1,composition(converse(sk1),composition(sk1,X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_23]) ).
cnf(c_0_33,negated_conjecture,
join(one,composition(converse(composition(sk1,sk2)),composition(sk1,sk2))) != one,
inference(rw,[status(thm)],[c_0_30,c_0_16]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_19]),c_0_13]),c_0_29]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : REL031-2 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n015.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 15:31:16 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/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.pUfj0DQUgj/E---3.1_10122.p
% 1.24/0.71 # Version: 3.1pre001
% 1.24/0.71 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.24/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.24/0.71 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.24/0.71 # Starting new_bool_3 with 300s (1) cores
% 1.24/0.71 # Starting new_bool_1 with 300s (1) cores
% 1.24/0.71 # Starting sh5l with 300s (1) cores
% 1.24/0.71 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 10199 completed with status 0
% 1.24/0.71 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.24/0.71 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.24/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.24/0.71 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.24/0.71 # No SInE strategy applied
% 1.24/0.71 # Search class: FUUPM-FFMF21-DFFFFFNN
% 1.24/0.71 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.24/0.71 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 811s (1) cores
% 1.24/0.71 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.24/0.71 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 136s (1) cores
% 1.24/0.71 # Starting new_bool_3 with 136s (1) cores
% 1.24/0.71 # Starting new_bool_1 with 136s (1) cores
% 1.24/0.71 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 10207 completed with status 0
% 1.24/0.71 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.24/0.71 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.24/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.24/0.71 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.24/0.71 # No SInE strategy applied
% 1.24/0.71 # Search class: FUUPM-FFMF21-DFFFFFNN
% 1.24/0.71 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.24/0.71 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 811s (1) cores
% 1.24/0.71 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.24/0.71 # Preprocessing time : 0.001 s
% 1.24/0.71 # Presaturation interreduction done
% 1.24/0.71
% 1.24/0.71 # Proof found!
% 1.24/0.71 # SZS status Unsatisfiable
% 1.24/0.71 # SZS output start CNFRefutation
% See solution above
% 1.24/0.71 # Parsed axioms : 19
% 1.24/0.71 # Removed by relevancy pruning/SinE : 0
% 1.24/0.71 # Initial clauses : 19
% 1.24/0.71 # Removed in clause preprocessing : 1
% 1.24/0.71 # Initial clauses in saturation : 18
% 1.24/0.71 # Processed clauses : 1002
% 1.24/0.71 # ...of these trivial : 484
% 1.24/0.71 # ...subsumed : 172
% 1.24/0.71 # ...remaining for further processing : 346
% 1.24/0.71 # Other redundant clauses eliminated : 0
% 1.24/0.71 # Clauses deleted for lack of memory : 0
% 1.24/0.71 # Backward-subsumed : 0
% 1.24/0.71 # Backward-rewritten : 74
% 1.24/0.71 # Generated clauses : 16223
% 1.24/0.71 # ...of the previous two non-redundant : 9851
% 1.24/0.71 # ...aggressively subsumed : 0
% 1.24/0.71 # Contextual simplify-reflections : 0
% 1.24/0.71 # Paramodulations : 16223
% 1.24/0.71 # Factorizations : 0
% 1.24/0.71 # NegExts : 0
% 1.24/0.71 # Equation resolutions : 0
% 1.24/0.71 # Total rewrite steps : 34363
% 1.24/0.71 # Propositional unsat checks : 0
% 1.24/0.71 # Propositional check models : 0
% 1.24/0.71 # Propositional check unsatisfiable : 0
% 1.24/0.71 # Propositional clauses : 0
% 1.24/0.71 # Propositional clauses after purity: 0
% 1.24/0.71 # Propositional unsat core size : 0
% 1.24/0.71 # Propositional preprocessing time : 0.000
% 1.24/0.71 # Propositional encoding time : 0.000
% 1.24/0.71 # Propositional solver time : 0.000
% 1.24/0.71 # Success case prop preproc time : 0.000
% 1.24/0.71 # Success case prop encoding time : 0.000
% 1.24/0.71 # Success case prop solver time : 0.000
% 1.24/0.71 # Current number of processed clauses : 254
% 1.24/0.71 # Positive orientable unit clauses : 248
% 1.24/0.71 # Positive unorientable unit clauses: 5
% 1.24/0.71 # Negative unit clauses : 1
% 1.24/0.71 # Non-unit-clauses : 0
% 1.24/0.71 # Current number of unprocessed clauses: 8807
% 1.24/0.71 # ...number of literals in the above : 8807
% 1.24/0.71 # Current number of archived formulas : 0
% 1.24/0.71 # Current number of archived clauses : 93
% 1.24/0.71 # Clause-clause subsumption calls (NU) : 0
% 1.24/0.71 # Rec. Clause-clause subsumption calls : 0
% 1.24/0.71 # Non-unit clause-clause subsumptions : 0
% 1.24/0.71 # Unit Clause-clause subsumption calls : 85
% 1.24/0.71 # Rewrite failures with RHS unbound : 0
% 1.24/0.71 # BW rewrite match attempts : 1425
% 1.24/0.71 # BW rewrite match successes : 250
% 1.24/0.71 # Condensation attempts : 0
% 1.24/0.71 # Condensation successes : 0
% 1.24/0.71 # Termbank termtop insertions : 348953
% 1.24/0.71
% 1.24/0.71 # -------------------------------------------------
% 1.24/0.71 # User time : 0.194 s
% 1.24/0.71 # System time : 0.012 s
% 1.24/0.71 # Total time : 0.206 s
% 1.24/0.71 # Maximum resident set size: 1640 pages
% 1.24/0.71
% 1.24/0.71 # -------------------------------------------------
% 1.24/0.71 # User time : 0.984 s
% 1.24/0.71 # System time : 0.041 s
% 1.24/0.71 # Total time : 1.025 s
% 1.24/0.71 # Maximum resident set size: 1684 pages
% 1.24/0.71 % E---3.1 exiting
%------------------------------------------------------------------------------