%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET825-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 : n018.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 : Tue Jul 19 01:02:55 EDT 2022 % Result : Unsatisfiable 0.12s 0.37s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SET825-2 : TPTP v8.1.0. Released v3.2.0. % 0.11/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n018.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 : 600 % 0.12/0.34 % DateTime : Sun Jul 10 06:04:27 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 6 Number of unprocessed: 6 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 6 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 4 conjectures. % 0.12/0.37 # There are 4 start rule candidates: % 0.12/0.37 # Found 3 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 4 start rule tableaux created. % 0.12/0.37 # 3 extension rule candidate clauses % 0.12/0.37 # 3 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 4 % 0.12/0.37 # Creating equality axioms % 0.12/0.37 # Ran out of tableaux, making start rules for all clauses % 0.12/0.37 # There were 1 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 1 total successful branch saturations. % 0.12/0.37 # There were 0 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 1 successful branch saturations after the branch. % 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_9, negated_conjecture, (v_Q(v_n))). % 0.12/0.37 cnf(i_0_7, plain, (c_in(c_Pair(X1,X1,X2,X2),c_Relation_OId,tc_prod(X2,X2)))). % 0.12/0.37 cnf(i_0_10, negated_conjecture, (~v_Q(v_m))). % 0.12/0.37 cnf(i_0_12, negated_conjecture, (c_in(c_Pair(v_n,v_m,tc_nat,tc_nat),X1,tc_prod(tc_nat,tc_nat))|~c_in(c_Pair(c_Suc(v_x(X1)),c_Suc(v_xa(X1)),tc_nat,tc_nat),X1,tc_prod(tc_nat,tc_nat))|~c_in(c_Pair(c_0,c_0,tc_nat,tc_nat),X1,tc_prod(tc_nat,tc_nat)))). % 0.12/0.37 cnf(i_0_11, negated_conjecture, (c_in(c_Pair(v_x(X1),v_xa(X1),tc_nat,tc_nat),X1,tc_prod(tc_nat,tc_nat))|c_in(c_Pair(v_n,v_m,tc_nat,tc_nat),X1,tc_prod(tc_nat,tc_nat))|~c_in(c_Pair(c_0,c_0,tc_nat,tc_nat),X1,tc_prod(tc_nat,tc_nat)))). % 0.12/0.37 cnf(i_0_8, plain, (X1=X2|~c_in(c_Pair(X1,X2,X3,X3),c_Relation_OId,tc_prod(X3,X3)))). % 0.12/0.37 cnf(i_0_125, plain, (X4=X4)). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 5 steps % 0.12/0.37 cnf(i_0_9, negated_conjecture, (v_Q(v_n)), inference(start_rule)). % 0.12/0.37 cnf(i_0_136, plain, (v_Q(v_n)), inference(extension_rule, [i_0_132])). % 0.12/0.37 cnf(i_0_176, plain, (v_Q(v_m)), inference(closure_rule, [i_0_10])). % 0.12/0.37 cnf(i_0_177, plain, (v_n!=v_m), inference(extension_rule, [i_0_8])). % 0.12/0.37 cnf(i_0_186, plain, (~c_in(c_Pair(v_n,v_m,X6,X6),c_Relation_OId,tc_prod(X6,X6))), inference(etableau_closure_rule, [i_0_186, ...])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 7 tableaux to operate on % 0.12/0.37 # Found closed tableau during pool population. % 0.12/0.37 # Proof search is over... % 0.12/0.37 # Freeing feature tree %------------------------------------------------------------------------------