TSTP Solution File: LAT281-2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LAT281-2 : TPTP v8.2.0. 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 : Mon May 20 23:26:31 EDT 2024
% Result : Unsatisfiable 0.20s 0.48s
% Output : CNFRefutation 0.20s
% 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 : 33 ( 2 equ; 16 neg)
% Maximal clause size : 4 ( 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; 8 con; 0-4 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Tarski_OPartialOrder__iff_2,axiom,
( c_Relation_Otrans(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/benchmark/theBenchmark.p',cls_Tarski_OPartialOrder__iff_2) ).
cnf(cls_Relation_Otrans__def_0,axiom,
( c_in(c_Pair(X5,X4,X2,X2),X1,tc_prod(X2,X2))
| ~ c_Relation_Otrans(X1,X2)
| ~ c_in(c_Pair(X3,X4,X2,X2),X1,tc_prod(X2,X2))
| ~ c_in(c_Pair(X5,X3,X2,X2),X1,tc_prod(X2,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Relation_Otrans__def_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/benchmark/theBenchmark.p',cls_Tarski_Or_A_61_61_Aorder_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/benchmark/theBenchmark.p',cls_Tarski_Ocl_A_58_APartialOrder_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(c_Pair(v_a,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_in(c_Pair(v_a,v_c,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(c_Pair(v_b,v_c,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(c_0_7,plain,
( c_Relation_Otrans(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_2]) ).
cnf(c_0_8,plain,
( c_in(c_Pair(X5,X4,X2,X2),X1,tc_prod(X2,X2))
| ~ c_Relation_Otrans(X1,X2)
| ~ c_in(c_Pair(X3,X4,X2,X2),X1,tc_prod(X2,X2))
| ~ c_in(c_Pair(X5,X3,X2,X2),X1,tc_prod(X2,X2)) ),
inference(fof_simplification,[status(thm)],[cls_Relation_Otrans__def_0]) ).
cnf(c_0_9,plain,
( c_Relation_Otrans(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,
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_12,plain,
( c_in(c_Pair(X5,X4,X2,X2),X1,tc_prod(X2,X2))
| ~ c_Relation_Otrans(X1,X2)
| ~ c_in(c_Pair(X3,X4,X2,X2),X1,tc_prod(X2,X2))
| ~ c_in(c_Pair(X5,X3,X2,X2),X1,tc_prod(X2,X2)) ),
c_0_8 ).
cnf(c_0_13,negated_conjecture,
c_in(c_Pair(v_a,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)),
cls_conjecture_0 ).
cnf(c_0_14,plain,
c_Relation_Otrans(v_r,t_a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_15,negated_conjecture,
~ c_in(c_Pair(v_a,v_c,t_a,t_a),v_r,tc_prod(t_a,t_a)),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_16,negated_conjecture,
( c_in(c_Pair(v_a,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_b,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_17,negated_conjecture,
c_in(c_Pair(v_b,v_c,t_a,t_a),v_r,tc_prod(t_a,t_a)),
cls_conjecture_1 ).
cnf(c_0_18,negated_conjecture,
~ c_in(c_Pair(v_a,v_c,t_a,t_a),v_r,tc_prod(t_a,t_a)),
c_0_15 ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LAT281-2 : TPTP v8.2.0. Released v3.2.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.15/0.34 % Computer : n026.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Sun May 19 19:54:53 EDT 2024
% 0.15/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/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.20/0.48 # Version: 3.1.0
% 0.20/0.48 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # G----_0031_C18_F1_SE_CS_SP_S0Y with pid 15207 completed with status 0
% 0.20/0.48 # Result found by G----_0031_C18_F1_SE_CS_SP_S0Y
% 0.20/0.48 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: FHUSF-FFSS32-SFFFFFNN
% 0.20/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.48 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.20/0.48 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.48 # Starting sh5l with 136s (1) cores
% 0.20/0.48 # G----_0031_C18_F1_SE_CS_SP_S0Y with pid 15212 completed with status 0
% 0.20/0.48 # Result found by G----_0031_C18_F1_SE_CS_SP_S0Y
% 0.20/0.48 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: FHUSF-FFSS32-SFFFFFNN
% 0.20/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.48 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Unsatisfiable
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.48 # Parsed axioms : 7
% 0.20/0.48 # Removed by relevancy pruning/SinE : 0
% 0.20/0.48 # Initial clauses : 7
% 0.20/0.48 # Removed in clause preprocessing : 0
% 0.20/0.48 # Initial clauses in saturation : 7
% 0.20/0.48 # Processed clauses : 10
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 0
% 0.20/0.48 # ...remaining for further processing : 10
% 0.20/0.48 # Other redundant clauses eliminated : 0
% 0.20/0.48 # Clauses deleted for lack of memory : 0
% 0.20/0.48 # Backward-subsumed : 0
% 0.20/0.48 # Backward-rewritten : 0
% 0.20/0.48 # Generated clauses : 4
% 0.20/0.48 # ...of the previous two non-redundant : 3
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 0
% 0.20/0.48 # Paramodulations : 4
% 0.20/0.48 # Factorizations : 0
% 0.20/0.48 # NegExts : 0
% 0.20/0.48 # Equation resolutions : 0
% 0.20/0.48 # Disequality decompositions : 0
% 0.20/0.48 # Total rewrite steps : 3
% 0.20/0.48 # ...of those cached : 1
% 0.20/0.48 # Propositional unsat checks : 0
% 0.20/0.48 # Propositional check models : 0
% 0.20/0.48 # Propositional check unsatisfiable : 0
% 0.20/0.48 # Propositional clauses : 0
% 0.20/0.48 # Propositional clauses after purity: 0
% 0.20/0.48 # Propositional unsat core size : 0
% 0.20/0.48 # Propositional preprocessing time : 0.000
% 0.20/0.48 # Propositional encoding time : 0.000
% 0.20/0.48 # Propositional solver time : 0.000
% 0.20/0.48 # Success case prop preproc time : 0.000
% 0.20/0.48 # Success case prop encoding time : 0.000
% 0.20/0.48 # Success case prop solver time : 0.000
% 0.20/0.48 # Current number of processed clauses : 10
% 0.20/0.48 # Positive orientable unit clauses : 5
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 1
% 0.20/0.48 # Non-unit-clauses : 4
% 0.20/0.48 # Current number of unprocessed clauses: 0
% 0.20/0.48 # ...number of literals in the above : 0
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 0
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.48 # Non-unit clause-clause subsumptions : 0
% 0.20/0.48 # Unit Clause-clause subsumption calls : 0
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 0
% 0.20/0.48 # BW rewrite match successes : 0
% 0.20/0.48 # Condensation attempts : 0
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 333
% 0.20/0.48 # Search garbage collected termcells : 14
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.002 s
% 0.20/0.48 # System time : 0.002 s
% 0.20/0.48 # Total time : 0.005 s
% 0.20/0.48 # Maximum resident set size: 1628 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.011 s
% 0.20/0.48 # System time : 0.007 s
% 0.20/0.48 # Total time : 0.018 s
% 0.20/0.48 # Maximum resident set size: 1692 pages
% 0.20/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------