TSTP Solution File: COM010-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : COM010-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : Sat May 4 07:29:48 EDT 2024
% Result : Unsatisfiable 0.42s 1.02s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 10 RR)
% Number of literals : 12 ( 11 equ; 3 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 : 10 ( 10 usr; 3 con; 0-4 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_3,negated_conjecture,
v_F != v_G,
file('/export/starexec/sandbox2/tmp/tmp.Q5tj4DhQRl/E---3.1_30807.p',cls_conjecture_3) ).
cnf(cls_UNITY_Osurjective__mk__program_0,axiom,
c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(X1,X2),c_Pair(c_UNITY_OActs(X1,X2),c_UNITY_OAllowedActs(X1,X2),tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2)))),tc_set(X2),tc_prod(tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2))))),X2) = X1,
file('/export/starexec/sandbox2/tmp/tmp.Q5tj4DhQRl/E---3.1_30807.p',cls_UNITY_Osurjective__mk__program_0) ).
cnf(cls_conjecture_2,negated_conjecture,
c_UNITY_OAllowedActs(v_F,t_a) = c_UNITY_OAllowedActs(v_G,t_a),
file('/export/starexec/sandbox2/tmp/tmp.Q5tj4DhQRl/E---3.1_30807.p',cls_conjecture_2) ).
cnf(cls_conjecture_0,negated_conjecture,
c_UNITY_OInit(v_F,t_a) = c_UNITY_OInit(v_G,t_a),
file('/export/starexec/sandbox2/tmp/tmp.Q5tj4DhQRl/E---3.1_30807.p',cls_conjecture_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_UNITY_OActs(v_F,t_a) = c_UNITY_OActs(v_G,t_a),
file('/export/starexec/sandbox2/tmp/tmp.Q5tj4DhQRl/E---3.1_30807.p',cls_conjecture_1) ).
cnf(c_0_5,negated_conjecture,
v_F != v_G,
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_6,axiom,
c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(X1,X2),c_Pair(c_UNITY_OActs(X1,X2),c_UNITY_OAllowedActs(X1,X2),tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2)))),tc_set(X2),tc_prod(tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2))))),X2) = X1,
cls_UNITY_Osurjective__mk__program_0 ).
cnf(c_0_7,negated_conjecture,
c_UNITY_OAllowedActs(v_F,t_a) = c_UNITY_OAllowedActs(v_G,t_a),
cls_conjecture_2 ).
cnf(c_0_8,negated_conjecture,
c_UNITY_OInit(v_F,t_a) = c_UNITY_OInit(v_G,t_a),
cls_conjecture_0 ).
cnf(c_0_9,negated_conjecture,
c_UNITY_OActs(v_F,t_a) = c_UNITY_OActs(v_G,t_a),
cls_conjecture_1 ).
cnf(c_0_10,negated_conjecture,
v_F != v_G,
c_0_5 ).
cnf(c_0_11,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_6,c_0_7]),c_0_8]),c_0_9]),c_0_6]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.33 % Problem : COM010-1 : TPTP v8.1.2. Released v3.2.0.
% 0.14/0.34 % Command : run_E %s %d THM
% 0.39/0.56 % Computer : n026.cluster.edu
% 0.39/0.56 % Model : x86_64 x86_64
% 0.39/0.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.39/0.56 % Memory : 8042.1875MB
% 0.39/0.56 % OS : Linux 3.10.0-693.el7.x86_64
% 0.39/0.56 % CPULimit : 300
% 0.39/0.56 % WCLimit : 300
% 0.39/0.56 % DateTime : Fri May 3 17:24:53 EDT 2024
% 0.39/0.56 % CPUTime :
% 0.42/0.94 Running first-order theorem proving
% 0.42/0.94 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.Q5tj4DhQRl/E---3.1_30807.p
% 0.42/1.02 # Version: 3.1.0
% 0.42/1.02 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.42/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/1.02 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.42/1.02 # Starting new_bool_3 with 300s (1) cores
% 0.42/1.02 # Starting new_bool_1 with 300s (1) cores
% 0.42/1.02 # Starting sh5l with 300s (1) cores
% 0.42/1.02 # new_bool_3 with pid 30925 completed with status 0
% 0.42/1.02 # Result found by new_bool_3
% 0.42/1.02 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.42/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/1.02 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.42/1.02 # Starting new_bool_3 with 300s (1) cores
% 0.42/1.02 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.42/1.02 # Search class: FGHSM-FSLS32-DFFFFFNN
% 0.42/1.02 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.42/1.02 # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 0.42/1.02 # SAT001_MinMin_p005000_rr_RG with pid 30928 completed with status 0
% 0.42/1.02 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.42/1.02 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.42/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/1.02 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.42/1.02 # Starting new_bool_3 with 300s (1) cores
% 0.42/1.02 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.42/1.02 # Search class: FGHSM-FSLS32-DFFFFFNN
% 0.42/1.02 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.42/1.02 # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 0.42/1.02 # Preprocessing time : 0.003 s
% 0.42/1.02 # Presaturation interreduction done
% 0.42/1.02
% 0.42/1.02 # Proof found!
% 0.42/1.02 # SZS status Unsatisfiable
% 0.42/1.02 # SZS output start CNFRefutation
% See solution above
% 0.42/1.02 # Parsed axioms : 2740
% 0.42/1.02 # Removed by relevancy pruning/SinE : 2499
% 0.42/1.02 # Initial clauses : 241
% 0.42/1.02 # Removed in clause preprocessing : 0
% 0.42/1.02 # Initial clauses in saturation : 241
% 0.42/1.02 # Processed clauses : 622
% 0.42/1.02 # ...of these trivial : 6
% 0.42/1.02 # ...subsumed : 182
% 0.42/1.02 # ...remaining for further processing : 434
% 0.42/1.02 # Other redundant clauses eliminated : 8
% 0.42/1.02 # Clauses deleted for lack of memory : 0
% 0.42/1.02 # Backward-subsumed : 3
% 0.42/1.02 # Backward-rewritten : 4
% 0.42/1.02 # Generated clauses : 764
% 0.42/1.02 # ...of the previous two non-redundant : 515
% 0.42/1.02 # ...aggressively subsumed : 0
% 0.42/1.02 # Contextual simplify-reflections : 1
% 0.42/1.02 # Paramodulations : 753
% 0.42/1.02 # Factorizations : 0
% 0.42/1.02 # NegExts : 0
% 0.42/1.02 # Equation resolutions : 11
% 0.42/1.02 # Disequality decompositions : 0
% 0.42/1.02 # Total rewrite steps : 239
% 0.42/1.02 # ...of those cached : 125
% 0.42/1.02 # Propositional unsat checks : 0
% 0.42/1.02 # Propositional check models : 0
% 0.42/1.02 # Propositional check unsatisfiable : 0
% 0.42/1.02 # Propositional clauses : 0
% 0.42/1.02 # Propositional clauses after purity: 0
% 0.42/1.02 # Propositional unsat core size : 0
% 0.42/1.02 # Propositional preprocessing time : 0.000
% 0.42/1.02 # Propositional encoding time : 0.000
% 0.42/1.02 # Propositional solver time : 0.000
% 0.42/1.02 # Success case prop preproc time : 0.000
% 0.42/1.02 # Success case prop encoding time : 0.000
% 0.42/1.02 # Success case prop solver time : 0.000
% 0.42/1.02 # Current number of processed clauses : 208
% 0.42/1.02 # Positive orientable unit clauses : 75
% 0.42/1.02 # Positive unorientable unit clauses: 0
% 0.42/1.02 # Negative unit clauses : 28
% 0.42/1.02 # Non-unit-clauses : 105
% 0.42/1.02 # Current number of unprocessed clauses: 353
% 0.42/1.02 # ...number of literals in the above : 788
% 0.42/1.02 # Current number of archived formulas : 0
% 0.42/1.02 # Current number of archived clauses : 226
% 0.42/1.02 # Clause-clause subsumption calls (NU) : 7565
% 0.42/1.02 # Rec. Clause-clause subsumption calls : 2968
% 0.42/1.02 # Non-unit clause-clause subsumptions : 50
% 0.42/1.02 # Unit Clause-clause subsumption calls : 486
% 0.42/1.02 # Rewrite failures with RHS unbound : 0
% 0.42/1.02 # BW rewrite match attempts : 65
% 0.42/1.02 # BW rewrite match successes : 4
% 0.42/1.02 # Condensation attempts : 0
% 0.42/1.02 # Condensation successes : 0
% 0.42/1.02 # Termbank termtop insertions : 38286
% 0.42/1.02 # Search garbage collected termcells : 7549
% 0.42/1.02
% 0.42/1.02 # -------------------------------------------------
% 0.42/1.02 # User time : 0.032 s
% 0.42/1.02 # System time : 0.011 s
% 0.42/1.02 # Total time : 0.042 s
% 0.42/1.02 # Maximum resident set size: 4256 pages
% 0.42/1.02
% 0.42/1.02 # -------------------------------------------------
% 0.42/1.02 # User time : 0.059 s
% 0.42/1.02 # System time : 0.015 s
% 0.42/1.02 # Total time : 0.074 s
% 0.42/1.02 # Maximum resident set size: 3496 pages
% 0.42/1.02 % E---3.1 exiting
% 0.42/1.02 % E exiting
%------------------------------------------------------------------------------