%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LAT274-2 : TPTP v8.1.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % Computer : n008.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 : 600s % DateTime : Sun Jul 17 04:49:59 EDT 2022 % Result : Unsatisfiable 0.19s 0.47s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : LAT274-2 : TPTP v8.1.0. Released v3.2.0. % 0.12/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n008.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Thu Jun 30 05:41:23 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y % 0.13/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 15 Number of unprocessed: 15 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 15 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 5 conjectures. % 0.13/0.37 # There are 5 start rule candidates: % 0.13/0.37 # Found 5 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 5 start rule tableaux created. % 0.13/0.37 # 10 extension rule candidate clauses % 0.13/0.37 # 5 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 5 % 0.13/0.37 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 13 tableaux to operate on % 0.19/0.47 # There were 3 total branch saturation attempts. % 0.19/0.47 # There were 0 of these attempts blocked. % 0.19/0.47 # There were 0 deferred branch saturation attempts. % 0.19/0.47 # There were 0 free duplicated saturations. % 0.19/0.47 # There were 3 total successful branch saturations. % 0.19/0.47 # There were 0 successful branch saturations in interreduction. % 0.19/0.47 # There were 0 successful branch saturations on the branch. % 0.19/0.47 # There were 3 successful branch saturations after the branch. % 0.19/0.47 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.47 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.47 # Begin clausification derivation % 0.19/0.47 % 0.19/0.47 # End clausification derivation % 0.19/0.47 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.47 cnf(i_0_26, negated_conjecture, (c_in(v_b,v_A,t_a))). % 0.19/0.47 cnf(i_0_29, negated_conjecture, (c_Tarski_OisLub(v_S,v_cl,v_L,t_a))). % 0.19/0.47 cnf(i_0_27, negated_conjecture, (c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)))). % 0.19/0.47 cnf(i_0_28, negated_conjecture, (v_S!=c_emptyset)). % 0.19/0.47 cnf(i_0_30, negated_conjecture, (~c_in(v_L,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),t_a))). % 0.19/0.47 cnf(i_0_16, plain, (X1=c_emptyset|c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(v_sko__4mk(X3,X1,v_r),X1,t_a)|c_in(v_sko__4mj(X1,X2,v_r),X1,t_a)|~c_lessequals(X1,X4,tc_set(t_a)))). % 0.19/0.47 cnf(i_0_23, plain, (c_in(c_Pair(X1,X2,t_a,t_a),v_r,tc_prod(t_a,t_a))|~c_Tarski_OisLub(X3,v_cl,X2,t_a)|~c_in(X1,X3,t_a))). % 0.19/0.47 cnf(i_0_20, plain, (c_in(c_Pair(X1,X2,X3,X3),X4,tc_prod(X3,X3))|~c_in(X2,X5,X3)|~c_lessequals(X5,c_Tarski_Ointerval(X4,X1,X6,X3),tc_set(X3)))). % 0.19/0.47 cnf(i_0_21, plain, (c_in(c_Pair(X1,X2,X3,X3),X4,tc_prod(X3,X3))|~c_in(X1,X5,X3)|~c_lessequals(X5,c_Tarski_Ointerval(X4,X6,X2,X3),tc_set(X3)))). % 0.19/0.47 cnf(i_0_22, plain, (c_in(X1,c_Tarski_Ointerval(X2,X3,X4,X5),X5)|~c_in(c_Pair(X3,X1,X5,X5),X2,tc_prod(X5,X5))|~c_in(c_Pair(X1,X4,X5,X5),X2,tc_prod(X5,X5)))). % 0.19/0.47 cnf(i_0_24, plain, (c_in(c_Pair(X1,X2,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(v_sko__4mi(X3,v_r,X2),X3,t_a)|~c_Tarski_OisLub(X3,v_cl,X1,t_a)|~c_in(X2,v_A,t_a))). % 0.19/0.47 cnf(i_0_25, plain, (c_in(c_Pair(X1,X2,t_a,t_a),v_r,tc_prod(t_a,t_a))|~c_Tarski_OisLub(X3,v_cl,X1,t_a)|~c_in(c_Pair(v_sko__4mi(X3,v_r,X2),X2,t_a,t_a),v_r,tc_prod(t_a,t_a))|~c_in(X2,v_A,t_a))). % 0.19/0.47 cnf(i_0_18, plain, (X1=c_emptyset|c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(v_sko__4mk(X3,X1,v_r),X1,t_a)|~c_in(c_Pair(X2,v_sko__4mj(X1,X2,v_r),t_a,t_a),v_r,tc_prod(t_a,t_a))|~c_lessequals(X1,X4,tc_set(t_a)))). % 0.19/0.47 cnf(i_0_17, plain, (X1=c_emptyset|c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(v_sko__4mj(X1,X2,v_r),X1,t_a)|~c_in(c_Pair(v_sko__4mk(X3,X1,v_r),X3,t_a,t_a),v_r,tc_prod(t_a,t_a))|~c_lessequals(X1,X4,tc_set(t_a)))). % 0.19/0.47 cnf(i_0_19, plain, (X1=c_emptyset|c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a))|~c_in(c_Pair(X2,v_sko__4mj(X1,X2,v_r),t_a,t_a),v_r,tc_prod(t_a,t_a))|~c_in(c_Pair(v_sko__4mk(X3,X1,v_r),X3,t_a,t_a),v_r,tc_prod(t_a,t_a))|~c_lessequals(X1,X4,tc_set(t_a)))). % 0.19/0.47 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.47 # Begin printing tableau % 0.19/0.47 # Found 10 steps % 0.19/0.47 cnf(i_0_27, negated_conjecture, (c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a))), inference(start_rule)). % 0.19/0.47 cnf(i_0_33, plain, (c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a))), inference(extension_rule, [i_0_21])). % 0.19/0.47 cnf(i_0_128, plain, (~c_in(v_sko__4mk(v_L,v_S,v_r),v_S,t_a)), inference(extension_rule, [i_0_16])). % 0.19/0.47 cnf(i_0_258, plain, (v_S=c_emptyset), inference(closure_rule, [i_0_28])). % 0.19/0.47 cnf(i_0_262, plain, (~c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a))), inference(closure_rule, [i_0_27])). % 0.19/0.47 cnf(i_0_259, plain, (c_in(c_Pair(v_a,v_L,t_a,t_a),v_r,tc_prod(t_a,t_a))), inference(extension_rule, [i_0_22])). % 0.19/0.47 cnf(i_0_266, plain, (c_in(v_L,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),t_a)), inference(closure_rule, [i_0_30])). % 0.19/0.47 cnf(i_0_127, plain, (c_in(c_Pair(v_sko__4mk(v_L,v_S,v_r),v_b,t_a,t_a),v_r,tc_prod(t_a,t_a))), inference(etableau_closure_rule, [i_0_127, ...])). % 0.19/0.47 cnf(i_0_261, plain, (c_in(v_sko__4mj(v_S,v_a,v_r),v_S,t_a)), inference(etableau_closure_rule, [i_0_261, ...])). % 0.19/0.47 cnf(i_0_268, plain, (~c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a))), inference(etableau_closure_rule, [i_0_268, ...])). % 0.19/0.47 # End printing tableau % 0.19/0.47 # SZS output end % 0.19/0.47 # Branches closed with saturation will be marked with an "s" % 0.19/0.47 # Child (31150) has found a proof. % 0.19/0.47 % 0.19/0.47 # Proof search is over... % 0.19/0.47 # Freeing feature tree %------------------------------------------------------------------------------