TSTP Solution File: LAT277-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT277-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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 18:08:15 EDT 2023
% Result : Unsatisfiable 0.71s 1.06s
% Output : CNFRefutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 17 ( 12 unt; 0 nHn; 17 RR)
% Number of literals : 24 ( 4 equ; 9 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 : 13 ( 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/sandbox2/tmp/tmp.JxHpy7Vd7c/E---3.1_25745.p',cls_Tarski_OPartialOrder__iff_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/sandbox2/tmp/tmp.JxHpy7Vd7c/E---3.1_25745.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/sandbox2/tmp/tmp.JxHpy7Vd7c/E---3.1_25745.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/sandbox2/tmp/tmp.JxHpy7Vd7c/E---3.1_25745.p',cls_Tarski_Ocl_A_58_APartialOrder_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/sandbox2/tmp/tmp.JxHpy7Vd7c/E---3.1_25745.p',cls_Relation_OreflD_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/sandbox2/tmp/tmp.JxHpy7Vd7c/E---3.1_25745.p',cls_conjecture_1) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_x,v_A,t_a),
file('/export/starexec/sandbox2/tmp/tmp.JxHpy7Vd7c/E---3.1_25745.p',cls_conjecture_0) ).
cnf(c_0_7,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)) ),
cls_Tarski_OPartialOrder__iff_0 ).
cnf(c_0_8,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_9,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_10,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_11,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) ),
cls_Relation_OreflD_0 ).
cnf(c_0_12,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_7,c_0_8]),c_0_9]),c_0_10])]) ).
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)),
cls_conjecture_1 ).
cnf(c_0_14,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_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
c_in(v_x,v_A,t_a),
cls_conjecture_0 ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.30 % Problem : LAT277-1 : TPTP v8.1.2. Released v3.2.0.
% 0.30/0.31 % Command : run_E %s %d THM
% 0.31/0.51 % Computer : n009.cluster.edu
% 0.31/0.51 % Model : x86_64 x86_64
% 0.31/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.31/0.51 % Memory : 8042.1875MB
% 0.31/0.51 % OS : Linux 3.10.0-693.el7.x86_64
% 0.31/0.51 % CPULimit : 2400
% 0.31/0.51 % WCLimit : 300
% 0.31/0.51 % DateTime : Mon Oct 2 10:10:15 EDT 2023
% 0.31/0.51 % CPUTime :
% 0.42/0.90 Running first-order theorem proving
% 0.42/0.90 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.JxHpy7Vd7c/E---3.1_25745.p
% 0.71/1.06 # Version: 3.1pre001
% 0.71/1.06 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.71/1.06 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/1.06 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.71/1.06 # Starting new_bool_3 with 300s (1) cores
% 0.71/1.06 # Starting new_bool_1 with 300s (1) cores
% 0.71/1.06 # Starting sh5l with 300s (1) cores
% 0.71/1.06 # new_bool_1 with pid 25825 completed with status 0
% 0.71/1.06 # Result found by new_bool_1
% 0.71/1.06 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.71/1.06 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/1.06 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.71/1.06 # Starting new_bool_3 with 300s (1) cores
% 0.71/1.06 # Starting new_bool_1 with 300s (1) cores
% 0.71/1.06 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.71/1.06 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.71/1.06 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.71/1.06 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 0.71/1.06 # G-E--_303_C18_F1_URBAN_S0Y with pid 25828 completed with status 0
% 0.71/1.06 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 0.71/1.06 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.71/1.06 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/1.06 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.71/1.06 # Starting new_bool_3 with 300s (1) cores
% 0.71/1.06 # Starting new_bool_1 with 300s (1) cores
% 0.71/1.06 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.71/1.06 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.71/1.06 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.71/1.06 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 0.71/1.06 # Preprocessing time : 0.016 s
% 0.71/1.06
% 0.71/1.06 # Proof found!
% 0.71/1.06 # SZS status Unsatisfiable
% 0.71/1.06 # SZS output start CNFRefutation
% See solution above
% 0.71/1.06 # Parsed axioms : 2746
% 0.71/1.06 # Removed by relevancy pruning/SinE : 2302
% 0.71/1.06 # Initial clauses : 444
% 0.71/1.06 # Removed in clause preprocessing : 0
% 0.71/1.06 # Initial clauses in saturation : 444
% 0.71/1.06 # Processed clauses : 466
% 0.71/1.06 # ...of these trivial : 9
% 0.71/1.06 # ...subsumed : 30
% 0.71/1.06 # ...remaining for further processing : 427
% 0.71/1.06 # Other redundant clauses eliminated : 0
% 0.71/1.06 # Clauses deleted for lack of memory : 0
% 0.71/1.06 # Backward-subsumed : 1
% 0.71/1.06 # Backward-rewritten : 5
% 0.71/1.06 # Generated clauses : 2200
% 0.71/1.06 # ...of the previous two non-redundant : 1676
% 0.71/1.06 # ...aggressively subsumed : 0
% 0.71/1.06 # Contextual simplify-reflections : 1
% 0.71/1.06 # Paramodulations : 2179
% 0.71/1.06 # Factorizations : 0
% 0.71/1.06 # NegExts : 0
% 0.71/1.06 # Equation resolutions : 21
% 0.71/1.06 # Total rewrite steps : 684
% 0.71/1.06 # Propositional unsat checks : 0
% 0.71/1.06 # Propositional check models : 0
% 0.71/1.06 # Propositional check unsatisfiable : 0
% 0.71/1.06 # Propositional clauses : 0
% 0.71/1.06 # Propositional clauses after purity: 0
% 0.71/1.06 # Propositional unsat core size : 0
% 0.71/1.06 # Propositional preprocessing time : 0.000
% 0.71/1.06 # Propositional encoding time : 0.000
% 0.71/1.06 # Propositional solver time : 0.000
% 0.71/1.06 # Success case prop preproc time : 0.000
% 0.71/1.06 # Success case prop encoding time : 0.000
% 0.71/1.06 # Success case prop solver time : 0.000
% 0.71/1.06 # Current number of processed clauses : 421
% 0.71/1.06 # Positive orientable unit clauses : 55
% 0.71/1.06 # Positive unorientable unit clauses: 2
% 0.71/1.06 # Negative unit clauses : 16
% 0.71/1.06 # Non-unit-clauses : 348
% 0.71/1.06 # Current number of unprocessed clauses: 1652
% 0.71/1.06 # ...number of literals in the above : 7511
% 0.71/1.06 # Current number of archived formulas : 0
% 0.71/1.06 # Current number of archived clauses : 6
% 0.71/1.06 # Clause-clause subsumption calls (NU) : 35458
% 0.71/1.06 # Rec. Clause-clause subsumption calls : 8563
% 0.71/1.06 # Non-unit clause-clause subsumptions : 19
% 0.71/1.06 # Unit Clause-clause subsumption calls : 313
% 0.71/1.06 # Rewrite failures with RHS unbound : 0
% 0.71/1.06 # BW rewrite match attempts : 25
% 0.71/1.06 # BW rewrite match successes : 5
% 0.71/1.06 # Condensation attempts : 0
% 0.71/1.06 # Condensation successes : 0
% 0.71/1.06 # Termbank termtop insertions : 75088
% 0.71/1.06
% 0.71/1.06 # -------------------------------------------------
% 0.71/1.06 # User time : 0.093 s
% 0.71/1.06 # System time : 0.013 s
% 0.71/1.06 # Total time : 0.106 s
% 0.71/1.06 # Maximum resident set size: 4424 pages
% 0.71/1.06
% 0.71/1.06 # -------------------------------------------------
% 0.71/1.06 # User time : 0.135 s
% 0.71/1.06 # System time : 0.016 s
% 0.71/1.06 # Total time : 0.150 s
% 0.71/1.06 # Maximum resident set size: 3480 pages
% 0.71/1.06 % E---3.1 exiting
% 0.71/1.06 % E---3.1 exiting
%------------------------------------------------------------------------------