TSTP Solution File: LAT277-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LAT277-1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 : Mon May 20 23:24:13 EDT 2024
% Result : Unsatisfiable 0.46s 0.67s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 13 unt; 0 nHn; 20 RR)
% Number of literals : 30 ( 4 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-4 aty)
% Number of variables : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Tarski_OPartialOrder__iff_0,axiom,
( c_Relation_Orefl(c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit),c_Tarski_Opotype_Oorder(X1,X2,tc_Product__Type_Ounit),X2)
| ~ c_in(X1,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X2,tc_Product__Type_Ounit)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Tarski_OPartialOrder__iff_0) ).
cnf(cls_Relation_OreflD_0,axiom,
( c_in(c_Pair(X4,X4,X3,X3),X2,tc_prod(X3,X3))
| ~ c_Relation_Orefl(X1,X2,X3)
| ~ c_in(X4,X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Relation_OreflD_0) ).
cnf(cls_Tarski_Or_A_61_61_Aorder_Acl_0,axiom,
v_r = c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Tarski_Or_A_61_61_Aorder_Acl_0) ).
cnf(cls_Tarski_OA_A_61_61_Apset_Acl_0,axiom,
v_A = c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Tarski_OA_A_61_61_Apset_Acl_0) ).
cnf(cls_Tarski_Ocl_A_58_APartialOrder_0,axiom,
c_in(v_cl,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Tarski_Ocl_A_58_APartialOrder_0) ).
cnf(cls_conjecture_1,negated_conjecture,
~ c_in(c_Pair(v_x,v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_x,v_A,t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_0_7,plain,
( c_Relation_Orefl(c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit),c_Tarski_Opotype_Oorder(X1,X2,tc_Product__Type_Ounit),X2)
| ~ c_in(X1,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X2,tc_Product__Type_Ounit)) ),
inference(fof_simplification,[status(thm)],[cls_Tarski_OPartialOrder__iff_0]) ).
cnf(c_0_8,plain,
( c_in(c_Pair(X4,X4,X3,X3),X2,tc_prod(X3,X3))
| ~ c_Relation_Orefl(X1,X2,X3)
| ~ c_in(X4,X1,X3) ),
inference(fof_simplification,[status(thm)],[cls_Relation_OreflD_0]) ).
cnf(c_0_9,plain,
( c_Relation_Orefl(c_Tarski_Opotype_Opset(X1,X2,tc_Product__Type_Ounit),c_Tarski_Opotype_Oorder(X1,X2,tc_Product__Type_Ounit),X2)
| ~ c_in(X1,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(X2,tc_Product__Type_Ounit)) ),
c_0_7 ).
cnf(c_0_10,axiom,
v_r = c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),
cls_Tarski_Or_A_61_61_Aorder_Acl_0 ).
cnf(c_0_11,axiom,
v_A = c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),
cls_Tarski_OA_A_61_61_Apset_Acl_0 ).
cnf(c_0_12,axiom,
c_in(v_cl,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
cls_Tarski_Ocl_A_58_APartialOrder_0 ).
cnf(c_0_13,negated_conjecture,
~ c_in(c_Pair(v_x,v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_14,plain,
( c_in(c_Pair(X4,X4,X3,X3),X2,tc_prod(X3,X3))
| ~ c_Relation_Orefl(X1,X2,X3)
| ~ c_in(X4,X1,X3) ),
c_0_8 ).
cnf(c_0_15,plain,
c_Relation_Orefl(v_A,v_r,t_a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]) ).
cnf(c_0_16,negated_conjecture,
~ c_in(c_Pair(v_x,v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)),
c_0_13 ).
cnf(c_0_17,plain,
( c_in(c_Pair(X1,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(X1,v_A,t_a) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
c_in(v_x,v_A,t_a),
cls_conjecture_0 ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LAT277-1 : TPTP v8.2.0. Released v3.2.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun May 19 20:04:08 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 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.46/0.67 # Version: 3.1.0
% 0.46/0.67 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.46/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.67 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.46/0.67 # Starting new_bool_3 with 300s (1) cores
% 0.46/0.67 # Starting new_bool_1 with 300s (1) cores
% 0.46/0.67 # Starting sh5l with 300s (1) cores
% 0.46/0.67 # new_bool_3 with pid 9242 completed with status 0
% 0.46/0.67 # Result found by new_bool_3
% 0.46/0.67 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.46/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.67 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.46/0.67 # Starting new_bool_3 with 300s (1) cores
% 0.46/0.67 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.46/0.67 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.46/0.67 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.46/0.67 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 0.46/0.67 # G-E--_303_C18_F1_URBAN_S0Y with pid 9245 completed with status 0
% 0.46/0.67 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 0.46/0.67 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.46/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.67 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.46/0.67 # Starting new_bool_3 with 300s (1) cores
% 0.46/0.67 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.46/0.67 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.46/0.67 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.46/0.67 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 0.46/0.67 # Preprocessing time : 0.018 s
% 0.46/0.67
% 0.46/0.67 # Proof found!
% 0.46/0.67 # SZS status Unsatisfiable
% 0.46/0.67 # SZS output start CNFRefutation
% See solution above
% 0.46/0.67 # Parsed axioms : 2746
% 0.46/0.67 # Removed by relevancy pruning/SinE : 2302
% 0.46/0.67 # Initial clauses : 444
% 0.46/0.67 # Removed in clause preprocessing : 0
% 0.46/0.67 # Initial clauses in saturation : 444
% 0.46/0.67 # Processed clauses : 466
% 0.46/0.67 # ...of these trivial : 9
% 0.46/0.67 # ...subsumed : 30
% 0.46/0.67 # ...remaining for further processing : 427
% 0.46/0.67 # Other redundant clauses eliminated : 0
% 0.46/0.67 # Clauses deleted for lack of memory : 0
% 0.46/0.67 # Backward-subsumed : 1
% 0.46/0.67 # Backward-rewritten : 5
% 0.46/0.67 # Generated clauses : 2200
% 0.46/0.67 # ...of the previous two non-redundant : 1676
% 0.46/0.67 # ...aggressively subsumed : 0
% 0.46/0.67 # Contextual simplify-reflections : 1
% 0.46/0.67 # Paramodulations : 2179
% 0.46/0.67 # Factorizations : 0
% 0.46/0.67 # NegExts : 0
% 0.46/0.67 # Equation resolutions : 21
% 0.46/0.67 # Disequality decompositions : 0
% 0.46/0.67 # Total rewrite steps : 684
% 0.46/0.67 # ...of those cached : 554
% 0.46/0.67 # Propositional unsat checks : 0
% 0.46/0.67 # Propositional check models : 0
% 0.46/0.67 # Propositional check unsatisfiable : 0
% 0.46/0.67 # Propositional clauses : 0
% 0.46/0.67 # Propositional clauses after purity: 0
% 0.46/0.67 # Propositional unsat core size : 0
% 0.46/0.67 # Propositional preprocessing time : 0.000
% 0.46/0.67 # Propositional encoding time : 0.000
% 0.46/0.67 # Propositional solver time : 0.000
% 0.46/0.67 # Success case prop preproc time : 0.000
% 0.46/0.67 # Success case prop encoding time : 0.000
% 0.46/0.67 # Success case prop solver time : 0.000
% 0.46/0.67 # Current number of processed clauses : 421
% 0.46/0.67 # Positive orientable unit clauses : 55
% 0.46/0.67 # Positive unorientable unit clauses: 2
% 0.46/0.67 # Negative unit clauses : 16
% 0.46/0.67 # Non-unit-clauses : 348
% 0.46/0.67 # Current number of unprocessed clauses: 1652
% 0.46/0.67 # ...number of literals in the above : 7511
% 0.46/0.67 # Current number of archived formulas : 0
% 0.46/0.67 # Current number of archived clauses : 6
% 0.46/0.67 # Clause-clause subsumption calls (NU) : 35458
% 0.46/0.67 # Rec. Clause-clause subsumption calls : 8563
% 0.46/0.67 # Non-unit clause-clause subsumptions : 19
% 0.46/0.67 # Unit Clause-clause subsumption calls : 313
% 0.46/0.67 # Rewrite failures with RHS unbound : 0
% 0.46/0.67 # BW rewrite match attempts : 25
% 0.46/0.67 # BW rewrite match successes : 5
% 0.46/0.67 # Condensation attempts : 0
% 0.46/0.67 # Condensation successes : 0
% 0.46/0.67 # Termbank termtop insertions : 79290
% 0.46/0.67 # Search garbage collected termcells : 7280
% 0.46/0.67
% 0.46/0.67 # -------------------------------------------------
% 0.46/0.67 # User time : 0.114 s
% 0.46/0.67 # System time : 0.011 s
% 0.46/0.67 # Total time : 0.124 s
% 0.46/0.67 # Maximum resident set size: 4348 pages
% 0.46/0.67
% 0.46/0.67 # -------------------------------------------------
% 0.46/0.67 # User time : 0.167 s
% 0.46/0.67 # System time : 0.014 s
% 0.46/0.67 # Total time : 0.181 s
% 0.46/0.67 # Maximum resident set size: 3468 pages
% 0.46/0.67 % E---3.1 exiting
% 0.46/0.67 % E exiting
%------------------------------------------------------------------------------