%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWV557-1.004 : TPTP v8.1.0. Released v4.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 : n024.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 : Wed Jul 20 18:22:34 EDT 2022 % Result : Unsatisfiable 0.19s 0.40s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : SWV557-1.004 : TPTP v8.1.0. Released v4.0.0. % 0.06/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n024.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Wed Jun 15 13:06:18 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.12/0.36 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Number of axioms: 7 Number of unprocessed: 7 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 7 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 1 conjectures. % 0.12/0.36 # There are 1 start rule candidates: % 0.12/0.36 # Found 5 unit axioms. % 0.12/0.36 # 1 start rule tableaux created. % 0.12/0.36 # 2 extension rule candidate clauses % 0.12/0.36 # 5 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.36 # Creating equality axioms % 0.12/0.36 # Ran out of tableaux, making start rules for all clauses % 0.12/0.36 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 10 tableaux to operate on % 0.19/0.40 # There were 1 total branch saturation attempts. % 0.19/0.40 # There were 0 of these attempts blocked. % 0.19/0.40 # There were 0 deferred branch saturation attempts. % 0.19/0.40 # There were 0 free duplicated saturations. % 0.19/0.40 # There were 1 total successful branch saturations. % 0.19/0.40 # There were 0 successful branch saturations in interreduction. % 0.19/0.40 # There were 0 successful branch saturations on the branch. % 0.19/0.40 # There were 1 successful branch saturations after the branch. % 0.19/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.40 # Begin clausification derivation % 0.19/0.40 % 0.19/0.40 # End clausification derivation % 0.19/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.40 cnf(i_0_14, negated_conjecture, (a1!=a2)). % 0.19/0.40 cnf(i_0_10, plain, (store(X1,X2,select(X1,X2))=X1)). % 0.19/0.40 cnf(i_0_8, plain, (select(store(X1,X2,X3),X2)=X3)). % 0.19/0.40 cnf(i_0_9, plain, (X1=X2|select(store(X3,X1,X4),X2)=select(X3,X2))). % 0.19/0.40 cnf(i_0_11, plain, (store(store(X1,X2,X3),X2,X4)=store(X1,X2,X4))). % 0.19/0.40 cnf(i_0_12, plain, (X1=X2|store(store(X3,X1,X4),X2,X5)=store(store(X3,X2,X5),X1,X4))). % 0.19/0.40 cnf(i_0_13, hypothesis, (store(store(store(store(a1,i1,select(a2,i1)),i2,select(store(a2,i1,select(a1,i1)),i2)),i3,select(store(store(a2,i1,select(a1,i1)),i2,select(store(a1,i1,select(a2,i1)),i2)),i3)),i4,select(store(store(store(a2,i1,select(a1,i1)),i2,select(store(a1,i1,select(a2,i1)),i2)),i3,select(store(store(a1,i1,select(a2,i1)),i2,select(store(a2,i1,select(a1,i1)),i2)),i3)),i4))=store(store(store(store(a2,i1,select(a1,i1)),i2,select(store(a1,i1,select(a2,i1)),i2)),i3,select(store(store(a1,i1,select(a2,i1)),i2,select(store(a2,i1,select(a1,i1)),i2)),i3)),i4,select(store(store(store(a1,i1,select(a2,i1)),i2,select(store(a2,i1,select(a1,i1)),i2)),i3,select(store(store(a2,i1,select(a1,i1)),i2,select(store(a1,i1,select(a2,i1)),i2)),i3)),i4)))). % 0.19/0.40 cnf(i_0_28, plain, (X6=X6)). % 0.19/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.40 # Begin printing tableau % 0.19/0.40 # Found 5 steps % 0.19/0.40 cnf(i_0_14, negated_conjecture, (a1!=a2), inference(start_rule)). % 0.19/0.40 cnf(i_0_34, plain, (a1!=a2), inference(extension_rule, [i_0_31])). % 0.19/0.40 cnf(i_0_53, plain, (a1!=store(a2,X2,select(a2,X2))), inference(extension_rule, [i_0_9])). % 0.19/0.40 cnf(i_0_54, plain, (store(a2,X2,select(a2,X2))!=a2), inference(closure_rule, [i_0_10])). % 0.19/0.40 cnf(i_0_63, plain, (select(store(X7,a1,X8),store(a2,X2,select(a2,X2)))=select(X7,store(a2,X2,select(a2,X2)))), inference(etableau_closure_rule, [i_0_63, ...])). % 0.19/0.40 # End printing tableau % 0.19/0.40 # SZS output end % 0.19/0.40 # Branches closed with saturation will be marked with an "s" % 0.19/0.40 # Child (12524) has found a proof. % 0.19/0.40 % 0.19/0.40 # Proof search is over... % 0.19/0.40 # Freeing feature tree %------------------------------------------------------------------------------