TSTP Solution File: REL008-3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : REL008-3 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:04 EDT 2024
% Result : Unsatisfiable 0.23s 0.49s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of clauses : 19 ( 19 unt; 0 nHn; 4 RR)
% Number of literals : 19 ( 18 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 : 35 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(converse_multiplicativity_10,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_multiplicativity_10) ).
cnf(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_idempotence_8) ).
cnf(converse_additivity_9,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/REL001-0.ax',composition_distributivity_7) ).
cnf(goals_17,negated_conjecture,
composition(sk1,join(sk2,sk3)) != join(composition(sk1,sk2),composition(sk1,sk3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_17) ).
cnf(c_0_5,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
converse_multiplicativity_10 ).
cnf(c_0_6,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_7,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
converse_additivity_9 ).
cnf(c_0_8,plain,
converse(composition(X1,converse(X2))) = composition(X2,converse(X1)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_10,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
composition_distributivity_7 ).
cnf(c_0_11,plain,
join(composition(X1,converse(X2)),converse(X3)) = converse(join(composition(X2,converse(X1)),X3)),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
composition(join(X1,converse(X2)),converse(X3)) = converse(composition(X3,join(converse(X1),X2))),
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_13,plain,
converse(join(composition(X1,converse(X2)),composition(X1,X3))) = converse(composition(X1,join(converse(X2),X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_5]),c_0_11]),c_0_12]) ).
cnf(c_0_14,negated_conjecture,
composition(sk1,join(sk2,sk3)) != join(composition(sk1,sk2),composition(sk1,sk3)),
inference(fof_simplification,[status(thm)],[goals_17]) ).
cnf(c_0_15,plain,
join(composition(X1,converse(X2)),composition(X1,X3)) = composition(X1,join(converse(X2),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_13]),c_0_6]) ).
cnf(c_0_16,negated_conjecture,
composition(sk1,join(sk2,sk3)) != join(composition(sk1,sk2),composition(sk1,sk3)),
c_0_14 ).
cnf(c_0_17,plain,
join(composition(X1,X2),composition(X1,X3)) = composition(X1,join(X2,X3)),
inference(spm,[status(thm)],[c_0_15,c_0_6]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : REL008-3 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n003.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon May 20 08:12:08 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.23/0.47 Running first-order model finding
% 0.23/0.47 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.23/0.49 # Version: 3.1.0
% 0.23/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.49 # Starting sh5l with 300s (1) cores
% 0.23/0.49 # new_bool_1 with pid 17837 completed with status 0
% 0.23/0.49 # Result found by new_bool_1
% 0.23/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.49 # Search class: FUUPM-FFMF21-DFFFFFNN
% 0.23/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.49 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 181s (1) cores
% 0.23/0.49 # H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with pid 17839 completed with status 0
% 0.23/0.49 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 0.23/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.49 # Search class: FUUPM-FFMF21-DFFFFFNN
% 0.23/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.49 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 181s (1) cores
% 0.23/0.49 # Preprocessing time : 0.001 s
% 0.23/0.49 # Presaturation interreduction done
% 0.23/0.49
% 0.23/0.49 # Proof found!
% 0.23/0.49 # SZS status Unsatisfiable
% 0.23/0.49 # SZS output start CNFRefutation
% See solution above
% 0.23/0.49 # Parsed axioms : 17
% 0.23/0.49 # Removed by relevancy pruning/SinE : 3
% 0.23/0.49 # Initial clauses : 14
% 0.23/0.49 # Removed in clause preprocessing : 0
% 0.23/0.49 # Initial clauses in saturation : 14
% 0.23/0.49 # Processed clauses : 189
% 0.23/0.49 # ...of these trivial : 63
% 0.23/0.49 # ...subsumed : 50
% 0.23/0.49 # ...remaining for further processing : 76
% 0.23/0.49 # Other redundant clauses eliminated : 0
% 0.23/0.49 # Clauses deleted for lack of memory : 0
% 0.23/0.49 # Backward-subsumed : 0
% 0.23/0.49 # Backward-rewritten : 4
% 0.23/0.49 # Generated clauses : 1523
% 0.23/0.49 # ...of the previous two non-redundant : 1256
% 0.23/0.49 # ...aggressively subsumed : 0
% 0.23/0.49 # Contextual simplify-reflections : 0
% 0.23/0.49 # Paramodulations : 1523
% 0.23/0.49 # Factorizations : 0
% 0.23/0.49 # NegExts : 0
% 0.23/0.49 # Equation resolutions : 0
% 0.23/0.49 # Disequality decompositions : 0
% 0.23/0.49 # Total rewrite steps : 1520
% 0.23/0.49 # ...of those cached : 796
% 0.23/0.49 # Propositional unsat checks : 0
% 0.23/0.49 # Propositional check models : 0
% 0.23/0.49 # Propositional check unsatisfiable : 0
% 0.23/0.49 # Propositional clauses : 0
% 0.23/0.49 # Propositional clauses after purity: 0
% 0.23/0.49 # Propositional unsat core size : 0
% 0.23/0.49 # Propositional preprocessing time : 0.000
% 0.23/0.49 # Propositional encoding time : 0.000
% 0.23/0.49 # Propositional solver time : 0.000
% 0.23/0.49 # Success case prop preproc time : 0.000
% 0.23/0.49 # Success case prop encoding time : 0.000
% 0.23/0.49 # Success case prop solver time : 0.000
% 0.23/0.49 # Current number of processed clauses : 58
% 0.23/0.49 # Positive orientable unit clauses : 53
% 0.23/0.49 # Positive unorientable unit clauses: 5
% 0.23/0.49 # Negative unit clauses : 0
% 0.23/0.49 # Non-unit-clauses : 0
% 0.23/0.49 # Current number of unprocessed clauses: 1087
% 0.23/0.49 # ...number of literals in the above : 1087
% 0.23/0.49 # Current number of archived formulas : 0
% 0.23/0.49 # Current number of archived clauses : 18
% 0.23/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.23/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.23/0.49 # Non-unit clause-clause subsumptions : 0
% 0.23/0.49 # Unit Clause-clause subsumption calls : 9
% 0.23/0.49 # Rewrite failures with RHS unbound : 0
% 0.23/0.49 # BW rewrite match attempts : 56
% 0.23/0.49 # BW rewrite match successes : 31
% 0.23/0.49 # Condensation attempts : 0
% 0.23/0.49 # Condensation successes : 0
% 0.23/0.49 # Termbank termtop insertions : 19925
% 0.23/0.49 # Search garbage collected termcells : 11
% 0.23/0.49
% 0.23/0.49 # -------------------------------------------------
% 0.23/0.49 # User time : 0.006 s
% 0.23/0.49 # System time : 0.006 s
% 0.23/0.49 # Total time : 0.012 s
% 0.23/0.49 # Maximum resident set size: 1656 pages
% 0.23/0.49
% 0.23/0.49 # -------------------------------------------------
% 0.23/0.49 # User time : 0.008 s
% 0.23/0.49 # System time : 0.006 s
% 0.23/0.49 # Total time : 0.014 s
% 0.23/0.49 # Maximum resident set size: 1704 pages
% 0.23/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------