%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN014-2 : TPTP v8.1.0. Released v1.0.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 : n028.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 : Thu Jul 21 06:07:16 EDT 2022 % Result : Unsatisfiable 0.13s 0.39s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : SYN014-2 : TPTP v8.1.0. Released v1.0.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 : n028.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 : Mon Jul 11 23:33:44 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_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN % 0.13/0.37 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 26 Number of unprocessed: 26 % 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 # 26 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 21 conjectures. % 0.13/0.37 # There are 21 start rule candidates: % 0.13/0.37 # Found 7 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 21 start rule tableaux created. % 0.13/0.37 # 19 extension rule candidate clauses % 0.13/0.37 # 7 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.39 # There were 4 total branch saturation attempts. % 0.13/0.39 # There were 0 of these attempts blocked. % 0.13/0.39 # There were 0 deferred branch saturation attempts. % 0.13/0.39 # There were 0 free duplicated saturations. % 0.13/0.39 # There were 4 total successful branch saturations. % 0.13/0.39 # There were 0 successful branch saturations in interreduction. % 0.13/0.39 # There were 0 successful branch saturations on the branch. % 0.13/0.39 # There were 4 successful branch saturations after the branch. % 0.13/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.39 # Begin clausification derivation % 0.13/0.39 % 0.13/0.39 # End clausification derivation % 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.39 cnf(i_0_52, negated_conjecture, (equalish(m,k))). % 0.13/0.39 cnf(i_0_49, negated_conjecture, (equalish(n,k))). % 0.13/0.39 cnf(i_0_27, plain, (equalish(X1,X1))). % 0.13/0.39 cnf(i_0_51, negated_conjecture, (~equalish(k,a))). % 0.13/0.39 cnf(i_0_50, negated_conjecture, (~equalish(m,a))). % 0.13/0.39 cnf(i_0_48, negated_conjecture, (~equalish(m,n))). % 0.13/0.39 cnf(i_0_47, negated_conjecture, (~equalish(n,a))). % 0.13/0.39 cnf(i_0_28, plain, (equalish(X1,X2)|~equalish(X2,X1))). % 0.13/0.39 cnf(i_0_35, negated_conjecture, (equalish(X1,m)|~element(X1,m)|~equalish(f(X1),X1))). % 0.13/0.39 cnf(i_0_34, negated_conjecture, (equalish(X1,m)|~element(X1,m)|~equalish(f(X1),m))). % 0.13/0.39 cnf(i_0_29, plain, (equalish(X1,X2)|~equalish(X3,X2)|~equalish(X1,X3))). % 0.13/0.39 cnf(i_0_32, negated_conjecture, (equalish(X1,k)|equalish(X1,a)|~element(X1,a))). % 0.13/0.39 cnf(i_0_39, negated_conjecture, (element(X1,n)|equalish(X1,n)|~equalish(g(X1),n))). % 0.13/0.39 cnf(i_0_33, negated_conjecture, (element(X1,a)|equalish(X1,a)|~equalish(X1,k))). % 0.13/0.39 cnf(i_0_44, negated_conjecture, (element(X1,k)|equalish(X1,k)|~equalish(X1,m))). % 0.13/0.39 cnf(i_0_45, negated_conjecture, (element(X1,k)|equalish(X1,k)|~equalish(X1,n))). % 0.13/0.39 cnf(i_0_41, negated_conjecture, (element(X1,g(X1))|element(X1,n)|equalish(X1,n))). % 0.13/0.39 cnf(i_0_42, negated_conjecture, (element(g(X1),X1)|element(X1,n)|equalish(X1,n))). % 0.13/0.39 cnf(i_0_31, plain, (element(X1,X2)|~element(X3,X2)|~equalish(X3,X1))). % 0.13/0.39 cnf(i_0_30, plain, (element(X1,X2)|~element(X1,X3)|~equalish(X3,X2))). % 0.13/0.39 cnf(i_0_40, negated_conjecture, (element(X1,n)|equalish(X1,n)|~equalish(g(X1),X1))). % 0.13/0.39 cnf(i_0_36, negated_conjecture, (element(X1,f(X1))|equalish(X1,m)|~element(X1,m))). % 0.13/0.39 cnf(i_0_37, negated_conjecture, (element(f(X1),X1)|equalish(X1,m)|~element(X1,m))). % 0.13/0.39 cnf(i_0_46, negated_conjecture, (equalish(X1,n)|equalish(X1,m)|equalish(X1,k)|~element(X1,k))). % 0.13/0.39 cnf(i_0_43, negated_conjecture, (equalish(X1,n)|equalish(X2,n)|equalish(X1,X2)|~element(X2,n)|~element(X2,X1)|~element(X1,X2))). % 0.13/0.39 cnf(i_0_38, negated_conjecture, (element(X1,m)|equalish(X1,m)|equalish(X2,X1)|~element(X1,X2)|~element(X2,X1))). % 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.39 # Begin printing tableau % 0.13/0.39 # Found 13 steps % 0.13/0.39 cnf(i_0_42, negated_conjecture, (element(g(m),m)|element(m,n)|equalish(m,n)), inference(start_rule)). % 0.13/0.39 cnf(i_0_79, plain, (equalish(m,n)), inference(closure_rule, [i_0_48])). % 0.13/0.39 cnf(i_0_77, plain, (element(g(m),m)), inference(extension_rule, [i_0_31])). % 0.13/0.39 cnf(i_0_115, plain, (element(m,m)), inference(extension_rule, [i_0_30])). % 0.13/0.39 cnf(i_0_78, plain, (element(m,n)), inference(etableau_closure_rule, [i_0_78, ...])). % 0.13/0.39 cnf(i_0_123, plain, (element(m,n)), inference(extension_rule, [i_0_43])). % 0.13/0.39 cnf(i_0_149, plain, (equalish(m,n)), inference(closure_rule, [i_0_48])). % 0.13/0.39 cnf(i_0_150, plain, (equalish(m,n)), inference(closure_rule, [i_0_48])). % 0.13/0.39 cnf(i_0_153, plain, (~element(m,m)), inference(closure_rule, [i_0_115])). % 0.13/0.39 cnf(i_0_154, plain, (~element(m,m)), inference(closure_rule, [i_0_115])). % 0.13/0.39 cnf(i_0_117, plain, (~equalish(g(m),m)), inference(etableau_closure_rule, [i_0_117, ...])). % 0.13/0.39 cnf(i_0_125, plain, (~equalish(m,n)), inference(etableau_closure_rule, [i_0_125, ...])). % 0.13/0.39 cnf(i_0_151, plain, (equalish(m,m)), inference(etableau_closure_rule, [i_0_151, ...])). % 0.13/0.39 # End printing tableau % 0.13/0.39 # SZS output end % 0.13/0.39 # Branches closed with saturation will be marked with an "s" % 0.13/0.39 # Child (17274) has found a proof. % 0.13/0.39 % 0.13/0.39 # Proof search is over... % 0.13/0.39 # Freeing feature tree %------------------------------------------------------------------------------